./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-23.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 377c50164edaea0f53442aa9874bfca88923ba53cddca037aa8305c7918e29d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:33:14,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:33:14,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:33:14,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:33:14,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:33:14,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:33:14,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:33:14,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:33:14,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:33:14,222 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:33:14,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:33:14,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:33:14,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:33:14,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:33:14,223 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:33:14,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:33:14,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:33:14,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:33:14,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:33:14,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:33:14,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:33:14,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:33:14,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:33:14,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:33:14,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:33:14,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:33:14,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:33:14,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:33:14,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:33:14,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:33:14,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:33:14,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:33:14,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 377c50164edaea0f53442aa9874bfca88923ba53cddca037aa8305c7918e29d9 [2025-02-05 21:33:14,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:33:14,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:33:14,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:33:14,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:33:14,448 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:33:14,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-23.i [2025-02-05 21:33:15,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac1f9b231/7ec5b52be7c64eaaa5753cb5ea16df2b/FLAG4f9f3ff47 [2025-02-05 21:33:15,966 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:33:15,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-23.i [2025-02-05 21:33:15,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac1f9b231/7ec5b52be7c64eaaa5753cb5ea16df2b/FLAG4f9f3ff47 [2025-02-05 21:33:16,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac1f9b231/7ec5b52be7c64eaaa5753cb5ea16df2b [2025-02-05 21:33:16,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:33:16,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:33:16,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:33:16,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:33:16,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:33:16,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16, skipping insertion in model container [2025-02-05 21:33:16,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:33:16,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-23.i[916,929] [2025-02-05 21:33:16,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:33:16,453 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:33:16,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-23.i[916,929] [2025-02-05 21:33:16,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:33:16,562 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:33:16,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16 WrapperNode [2025-02-05 21:33:16,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:33:16,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:33:16,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:33:16,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:33:16,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,646 INFO L138 Inliner]: procedures = 26, calls = 90, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 516 [2025-02-05 21:33:16,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:33:16,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:33:16,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:33:16,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:33:16,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,704 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:33:16,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:33:16,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:33:16,767 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:33:16,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:33:16,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (1/1) ... [2025-02-05 21:33:16,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:33:16,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:16,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:33:16,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:33:16,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:33:16,813 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:33:16,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:33:16,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:33:16,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:33:16,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:33:16,912 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:33:16,914 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:33:17,481 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 21:33:17,481 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:33:17,495 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:33:17,495 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:33:17,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:33:17 BoogieIcfgContainer [2025-02-05 21:33:17,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:33:17,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:33:17,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:33:17,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:33:17,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:33:16" (1/3) ... [2025-02-05 21:33:17,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fddd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:33:17, skipping insertion in model container [2025-02-05 21:33:17,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:33:16" (2/3) ... [2025-02-05 21:33:17,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fddd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:33:17, skipping insertion in model container [2025-02-05 21:33:17,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:33:17" (3/3) ... [2025-02-05 21:33:17,502 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-23.i [2025-02-05 21:33:17,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:33:17,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-23.i that has 2 procedures, 219 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:33:17,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:33:17,557 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79ea2b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:33:17,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:33:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 139 states have (on average 1.5035971223021583) internal successors, (209), 140 states have internal predecessors, (209), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 21:33:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:33:17,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:17,581 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:17,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:17,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash 273717043, now seen corresponding path program 1 times [2025-02-05 21:33:17,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:17,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006243495] [2025-02-05 21:33:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:17,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:33:17,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:33:17,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:17,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-02-05 21:33:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006243495] [2025-02-05 21:33:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006243495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197646955] [2025-02-05 21:33:18,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:18,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:18,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:18,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:33:18,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:33:18,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:33:18,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:33:18,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:18,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:18,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:33:18,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-02-05 21:33:18,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:33:18,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197646955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:18,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:33:18,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:33:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591981285] [2025-02-05 21:33:18,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:18,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:33:18,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:18,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:33:18,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:33:18,321 INFO L87 Difference]: Start difference. First operand has 219 states, 139 states have (on average 1.5035971223021583) internal successors, (209), 140 states have internal predecessors, (209), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-02-05 21:33:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:18,372 INFO L93 Difference]: Finished difference Result 432 states and 798 transitions. [2025-02-05 21:33:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:33:18,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) Word has length 483 [2025-02-05 21:33:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:18,379 INFO L225 Difference]: With dead ends: 432 [2025-02-05 21:33:18,379 INFO L226 Difference]: Without dead ends: 216 [2025-02-05 21:33:18,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:33:18,387 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:18,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:33:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-05 21:33:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-05 21:33:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.4744525547445255) internal successors, (202), 137 states have internal predecessors, (202), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 21:33:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 356 transitions. [2025-02-05 21:33:18,467 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 356 transitions. Word has length 483 [2025-02-05 21:33:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:18,468 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 356 transitions. [2025-02-05 21:33:18,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-02-05 21:33:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 356 transitions. [2025-02-05 21:33:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:33:18,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:18,475 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:18,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:33:18,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:33:18,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:18,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1415287438, now seen corresponding path program 1 times [2025-02-05 21:33:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:18,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733346819] [2025-02-05 21:33:18,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:18,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:18,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:33:18,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:33:18,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:18,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:33:19,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:19,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733346819] [2025-02-05 21:33:19,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733346819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:19,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:19,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:33:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217194107] [2025-02-05 21:33:19,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:19,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:33:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:19,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:33:19,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:19,392 INFO L87 Difference]: Start difference. First operand 216 states and 356 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:19,562 INFO L93 Difference]: Finished difference Result 643 states and 1064 transitions. [2025-02-05 21:33:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:19,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-02-05 21:33:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:19,572 INFO L225 Difference]: With dead ends: 643 [2025-02-05 21:33:19,575 INFO L226 Difference]: Without dead ends: 430 [2025-02-05 21:33:19,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:19,577 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 215 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:19,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1196 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:33:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-05 21:33:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2025-02-05 21:33:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-02-05 21:33:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 705 transitions. [2025-02-05 21:33:19,648 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 705 transitions. Word has length 483 [2025-02-05 21:33:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:19,649 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 705 transitions. [2025-02-05 21:33:19,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 705 transitions. [2025-02-05 21:33:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-05 21:33:19,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:19,656 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:19,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:33:19,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:19,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash 52822626, now seen corresponding path program 1 times [2025-02-05 21:33:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591778780] [2025-02-05 21:33:19,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:19,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:33:19,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:33:19,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:19,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:33:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591778780] [2025-02-05 21:33:20,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591778780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:20,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:20,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:33:20,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679797673] [2025-02-05 21:33:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:20,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:33:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:20,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:33:20,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:20,454 INFO L87 Difference]: Start difference. First operand 426 states and 705 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:20,967 INFO L93 Difference]: Finished difference Result 1832 states and 3013 transitions. [2025-02-05 21:33:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:33:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 484 [2025-02-05 21:33:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:20,981 INFO L225 Difference]: With dead ends: 1832 [2025-02-05 21:33:20,981 INFO L226 Difference]: Without dead ends: 1409 [2025-02-05 21:33:20,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:33:20,984 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 592 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:20,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 2007 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:33:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-02-05 21:33:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1399. [2025-02-05 21:33:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 826 states have (on average 1.4188861985472154) internal successors, (1172), 830 states have internal predecessors, (1172), 564 states have call successors, (564), 8 states have call predecessors, (564), 8 states have return successors, (564), 560 states have call predecessors, (564), 564 states have call successors, (564) [2025-02-05 21:33:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2300 transitions. [2025-02-05 21:33:21,276 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2300 transitions. Word has length 484 [2025-02-05 21:33:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:21,277 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 2300 transitions. [2025-02-05 21:33:21,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2300 transitions. [2025-02-05 21:33:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:33:21,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:21,285 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:21,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:33:21,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:21,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash -383741711, now seen corresponding path program 1 times [2025-02-05 21:33:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:21,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859326234] [2025-02-05 21:33:21,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:21,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:21,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:21,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:21,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:33:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859326234] [2025-02-05 21:33:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859326234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:33:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735503030] [2025-02-05 21:33:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:21,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:33:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:21,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:33:21,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:33:21,525 INFO L87 Difference]: Start difference. First operand 1399 states and 2300 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:21,694 INFO L93 Difference]: Finished difference Result 3859 states and 6342 transitions. [2025-02-05 21:33:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:33:21,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-02-05 21:33:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:21,709 INFO L225 Difference]: With dead ends: 3859 [2025-02-05 21:33:21,709 INFO L226 Difference]: Without dead ends: 2463 [2025-02-05 21:33:21,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:33:21,713 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 245 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:21,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 681 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:33:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2025-02-05 21:33:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2453. [2025-02-05 21:33:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 1496 states have (on average 1.429144385026738) internal successors, (2138), 1508 states have internal predecessors, (2138), 940 states have call successors, (940), 16 states have call predecessors, (940), 16 states have return successors, (940), 928 states have call predecessors, (940), 940 states have call successors, (940) [2025-02-05 21:33:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 4018 transitions. [2025-02-05 21:33:21,914 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 4018 transitions. Word has length 485 [2025-02-05 21:33:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:21,941 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 4018 transitions. [2025-02-05 21:33:21,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 4018 transitions. [2025-02-05 21:33:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:33:21,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:21,956 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:21,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:33:21,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:21,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:21,956 INFO L85 PathProgramCache]: Analyzing trace with hash -697329034, now seen corresponding path program 1 times [2025-02-05 21:33:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:21,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579268125] [2025-02-05 21:33:21,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:21,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:21,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:22,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:22,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:22,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:33:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579268125] [2025-02-05 21:33:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579268125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:22,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:33:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736902551] [2025-02-05 21:33:22,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:22,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:33:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:22,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:33:22,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:22,629 INFO L87 Difference]: Start difference. First operand 2453 states and 4018 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:23,398 INFO L93 Difference]: Finished difference Result 6993 states and 11408 transitions. [2025-02-05 21:33:23,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:23,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-02-05 21:33:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:23,431 INFO L225 Difference]: With dead ends: 6993 [2025-02-05 21:33:23,432 INFO L226 Difference]: Without dead ends: 4543 [2025-02-05 21:33:23,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:23,444 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 826 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:23,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 729 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:33:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-02-05 21:33:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 2493. [2025-02-05 21:33:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 1528 states have (on average 1.4201570680628273) internal successors, (2170), 1540 states have internal predecessors, (2170), 940 states have call successors, (940), 24 states have call predecessors, (940), 24 states have return successors, (940), 928 states have call predecessors, (940), 940 states have call successors, (940) [2025-02-05 21:33:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 4050 transitions. [2025-02-05 21:33:23,775 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 4050 transitions. Word has length 485 [2025-02-05 21:33:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 4050 transitions. [2025-02-05 21:33:23,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 4050 transitions. [2025-02-05 21:33:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:33:23,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:23,782 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:23,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:33:23,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:23,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash -442592489, now seen corresponding path program 1 times [2025-02-05 21:33:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:23,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300372533] [2025-02-05 21:33:23,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:23,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:23,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:23,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:23,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:33:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300372533] [2025-02-05 21:33:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300372533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:24,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:24,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:33:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392060961] [2025-02-05 21:33:24,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:24,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:33:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:24,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:33:24,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:24,228 INFO L87 Difference]: Start difference. First operand 2493 states and 4050 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:25,026 INFO L93 Difference]: Finished difference Result 8959 states and 14551 transitions. [2025-02-05 21:33:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-02-05 21:33:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:25,065 INFO L225 Difference]: With dead ends: 8959 [2025-02-05 21:33:25,066 INFO L226 Difference]: Without dead ends: 6469 [2025-02-05 21:33:25,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:25,077 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 553 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:25,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 929 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:33:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6469 states. [2025-02-05 21:33:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6469 to 4645. [2025-02-05 21:33:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4645 states, 2856 states have (on average 1.427170868347339) internal successors, (4076), 2884 states have internal predecessors, (4076), 1748 states have call successors, (1748), 40 states have call predecessors, (1748), 40 states have return successors, (1748), 1720 states have call predecessors, (1748), 1748 states have call successors, (1748) [2025-02-05 21:33:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4645 states to 4645 states and 7572 transitions. [2025-02-05 21:33:25,631 INFO L78 Accepts]: Start accepts. Automaton has 4645 states and 7572 transitions. Word has length 485 [2025-02-05 21:33:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:25,632 INFO L471 AbstractCegarLoop]: Abstraction has 4645 states and 7572 transitions. [2025-02-05 21:33:25,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4645 states and 7572 transitions. [2025-02-05 21:33:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:33:25,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:25,636 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:25,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:33:25,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:25,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1287064360, now seen corresponding path program 1 times [2025-02-05 21:33:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:25,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581751067] [2025-02-05 21:33:25,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:25,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:25,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:25,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:25,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:33:27,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:27,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581751067] [2025-02-05 21:33:27,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581751067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:27,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:27,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 21:33:27,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138019532] [2025-02-05 21:33:27,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:27,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:33:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:27,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:33:27,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:33:27,200 INFO L87 Difference]: Start difference. First operand 4645 states and 7572 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:35,406 INFO L93 Difference]: Finished difference Result 26099 states and 42406 transitions. [2025-02-05 21:33:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 21:33:35,408 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-02-05 21:33:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:35,503 INFO L225 Difference]: With dead ends: 26099 [2025-02-05 21:33:35,503 INFO L226 Difference]: Without dead ends: 21457 [2025-02-05 21:33:35,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 21:33:35,527 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 4112 mSDsluCounter, 3698 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 1471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 4387 SdHoareTripleChecker+Invalid, 4913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1471 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:35,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 4387 Invalid, 4913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1471 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-02-05 21:33:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2025-02-05 21:33:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 12952. [2025-02-05 21:33:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12952 states, 8957 states have (on average 1.5007256894049348) internal successors, (13442), 9065 states have internal predecessors, (13442), 3846 states have call successors, (3846), 148 states have call predecessors, (3846), 148 states have return successors, (3846), 3738 states have call predecessors, (3846), 3846 states have call successors, (3846) [2025-02-05 21:33:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12952 states to 12952 states and 21134 transitions. [2025-02-05 21:33:36,889 INFO L78 Accepts]: Start accepts. Automaton has 12952 states and 21134 transitions. Word has length 485 [2025-02-05 21:33:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:36,890 INFO L471 AbstractCegarLoop]: Abstraction has 12952 states and 21134 transitions. [2025-02-05 21:33:36,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:33:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12952 states and 21134 transitions. [2025-02-05 21:33:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:33:36,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:36,909 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:36,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:33:36,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:36,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash -833755693, now seen corresponding path program 1 times [2025-02-05 21:33:36,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:36,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519941944] [2025-02-05 21:33:36,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:36,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:37,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:37,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:37,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 177 proven. 51 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:33:37,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:37,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519941944] [2025-02-05 21:33:37,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519941944] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:37,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18251230] [2025-02-05 21:33:37,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:37,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:37,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:37,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:33:37,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:33:37,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:37,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:37,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:37,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:37,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:33:37,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 2848 proven. 30 refuted. 0 times theorem prover too weak. 8826 trivial. 0 not checked. [2025-02-05 21:33:37,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:33:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 198 proven. 30 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:33:38,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18251230] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:33:38,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:33:38,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 21:33:38,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263609564] [2025-02-05 21:33:38,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:33:38,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:33:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:38,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:33:38,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:33:38,249 INFO L87 Difference]: Start difference. First operand 12952 states and 21134 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 3 states have call successors, (104), 2 states have call predecessors, (104), 4 states have return successors, (106), 3 states have call predecessors, (106), 3 states have call successors, (106) [2025-02-05 21:33:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:39,299 INFO L93 Difference]: Finished difference Result 23273 states and 37855 transitions. [2025-02-05 21:33:39,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:33:39,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 3 states have call successors, (104), 2 states have call predecessors, (104), 4 states have return successors, (106), 3 states have call predecessors, (106), 3 states have call successors, (106) Word has length 485 [2025-02-05 21:33:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:39,349 INFO L225 Difference]: With dead ends: 23273 [2025-02-05 21:33:39,349 INFO L226 Difference]: Without dead ends: 10068 [2025-02-05 21:33:39,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 967 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:33:39,380 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 336 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:39,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 601 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:33:39,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10068 states. [2025-02-05 21:33:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10068 to 9860. [2025-02-05 21:33:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9860 states, 6943 states have (on average 1.4961832061068703) internal successors, (10388), 7027 states have internal predecessors, (10388), 2796 states have call successors, (2796), 120 states have call predecessors, (2796), 120 states have return successors, (2796), 2712 states have call predecessors, (2796), 2796 states have call successors, (2796) [2025-02-05 21:33:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 15980 transitions. [2025-02-05 21:33:40,192 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 15980 transitions. Word has length 485 [2025-02-05 21:33:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:40,193 INFO L471 AbstractCegarLoop]: Abstraction has 9860 states and 15980 transitions. [2025-02-05 21:33:40,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 3 states have call successors, (104), 2 states have call predecessors, (104), 4 states have return successors, (106), 3 states have call predecessors, (106), 3 states have call successors, (106) [2025-02-05 21:33:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 15980 transitions. [2025-02-05 21:33:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:33:40,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:40,203 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:40,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:33:40,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:40,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:40,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash -336244065, now seen corresponding path program 1 times [2025-02-05 21:33:40,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:40,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733312070] [2025-02-05 21:33:40,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:40,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:40,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:40,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:40,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 162 proven. 66 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:33:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733312070] [2025-02-05 21:33:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733312070] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:33:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655742260] [2025-02-05 21:33:40,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:40,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:40,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:40,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:33:40,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:33:40,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:41,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:41,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:41,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:41,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:33:41,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 4936 proven. 66 refuted. 0 times theorem prover too weak. 6702 trivial. 0 not checked. [2025-02-05 21:33:41,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:33:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 162 proven. 66 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:33:41,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655742260] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:33:41,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:33:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:33:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413355328] [2025-02-05 21:33:41,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:33:41,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:33:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:41,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:33:41,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:33:41,591 INFO L87 Difference]: Start difference. First operand 9860 states and 15980 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (99), 2 states have call predecessors, (99), 4 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) [2025-02-05 21:33:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:42,769 INFO L93 Difference]: Finished difference Result 16350 states and 26545 transitions. [2025-02-05 21:33:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:33:42,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (99), 2 states have call predecessors, (99), 4 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) Word has length 485 [2025-02-05 21:33:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:42,802 INFO L225 Difference]: With dead ends: 16350 [2025-02-05 21:33:42,802 INFO L226 Difference]: Without dead ends: 6493 [2025-02-05 21:33:42,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 967 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:33:42,824 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 494 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:42,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 757 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:33:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2025-02-05 21:33:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 5482. [2025-02-05 21:33:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5482 states, 3890 states have (on average 1.4645244215938302) internal successors, (5697), 3931 states have internal predecessors, (5697), 1508 states have call successors, (1508), 83 states have call predecessors, (1508), 83 states have return successors, (1508), 1467 states have call predecessors, (1508), 1508 states have call successors, (1508) [2025-02-05 21:33:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5482 states to 5482 states and 8713 transitions. [2025-02-05 21:33:43,612 INFO L78 Accepts]: Start accepts. Automaton has 5482 states and 8713 transitions. Word has length 485 [2025-02-05 21:33:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:43,613 INFO L471 AbstractCegarLoop]: Abstraction has 5482 states and 8713 transitions. [2025-02-05 21:33:43,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (99), 2 states have call predecessors, (99), 4 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) [2025-02-05 21:33:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5482 states and 8713 transitions. [2025-02-05 21:33:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-05 21:33:43,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:43,620 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:33:43,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 21:33:43,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:43,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:43,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1333316418, now seen corresponding path program 1 times [2025-02-05 21:33:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:43,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384617859] [2025-02-05 21:33:43,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:43,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:44,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:44,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:44,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:33:44,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144254906] [2025-02-05 21:33:44,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:44,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:33:44,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:33:44,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:33:44,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 21:33:44,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-05 21:33:44,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-05 21:33:44,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:44,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:44,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 21:33:44,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:33:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 4470 proven. 681 refuted. 0 times theorem prover too weak. 6553 trivial. 0 not checked. [2025-02-05 21:33:48,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:34:37,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:37,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384617859] [2025-02-05 21:34:37,309 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:34:37,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144254906] [2025-02-05 21:34:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144254906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:34:37,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:34:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-02-05 21:34:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990183181] [2025-02-05 21:34:37,311 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:34:37,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:34:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:37,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:34:37,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:34:37,320 INFO L87 Difference]: Start difference. First operand 5482 states and 8713 transitions. Second operand has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 16 states have internal predecessors, (121), 5 states have call successors, (77), 5 states have call predecessors, (77), 7 states have return successors, (77), 5 states have call predecessors, (77), 5 states have call successors, (77)