/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:20,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:20,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:20,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:20,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:20,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:20,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:20,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:20,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:20,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:20,419 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:20,419 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:20,419 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:20,419 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:20,419 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:20,419 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:20,419 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:20,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:20,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:20,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:20,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:20,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:20,420 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:20,421 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:20,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:20,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:20,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:20,644 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:20,644 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:20,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl [2025-04-26 16:20:20,647 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl' [2025-04-26 16:20:20,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:20,664 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:20,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:20,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:20,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:20,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,698 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:20,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:20,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:20,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:20,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:20,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:20,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:20,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:20,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:20,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/1) ... [2025-04-26 16:20:20,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:20,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:20,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:20,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:20,774 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:20,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:20,774 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2025-04-26 16:20:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-26 16:20:20,774 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-26 16:20:20,775 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:20,804 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:20,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:20,856 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:20,856 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:20,862 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:20,862 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:20:20,862 INFO L201 PluginConnector]: Adding new model TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:20 BoogieIcfgContainer [2025-04-26 16:20:20,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:20,863 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:20,863 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:20,867 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:20,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:20,868 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:20" (1/2) ... [2025-04-26 16:20:20,869 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cda558f and model type TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:20, skipping insertion in model container [2025-04-26 16:20:20,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:20,869 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:20" (2/2) ... [2025-04-26 16:20:20,870 INFO L376 chiAutomizerObserver]: Analyzing ICFG TwoActiveWorkersSirius.bpl [2025-04-26 16:20:20,904 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-26 16:20:20,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 39 flow [2025-04-26 16:20:20,955 INFO L116 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-04-26 16:20:20,962 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 16:20:20,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 19 events. 2/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 7. Up to 3 conditions per place. [2025-04-26 16:20:20,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 16 transitions, 39 flow [2025-04-26 16:20:20,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 16 transitions, 39 flow [2025-04-26 16:20:20,969 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 17 places, 16 transitions, 39 flow [2025-04-26 16:20:20,979 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:20,979 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:20,979 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:20,980 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:20,980 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:20,980 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:20,980 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:20,980 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:20,981 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:21,010 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2025-04-26 16:20:21,011 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:21,011 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:21,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:21,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:21,015 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:21,015 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 47 states, but on-demand construction may add more states [2025-04-26 16:20:21,020 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2025-04-26 16:20:21,020 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:21,020 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:21,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:21,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:21,025 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:20:21,027 INFO L754 eck$LassoCheckResult]: Loop: "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[33] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[38] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[39] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[40] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[44] workerEXIT-->L21-2: Formula: (= v_i_13 (+ v_workerThread1of1ForFork0_thidvar0_4 1)) InVars {workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} AuxVars[] AssignedVars[]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" [2025-04-26 16:20:21,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 1 times [2025-04-26 16:20:21,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742290805] [2025-04-26 16:20:21,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:21,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:21,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:21,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:21,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:21,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash 408741230, now seen corresponding path program 1 times [2025-04-26 16:20:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313607684] [2025-04-26 16:20:21,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:21,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:21,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:21,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313607684] [2025-04-26 16:20:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313607684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:21,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270778372] [2025-04-26 16:20:21,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:21,193 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:21,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:21,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:21,212 INFO L87 Difference]: Start difference. First operand currently 47 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:21,246 INFO L93 Difference]: Finished difference Result 33 states and 58 transitions. [2025-04-26 16:20:21,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 58 transitions. [2025-04-26 16:20:21,248 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2025-04-26 16:20:21,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 47 transitions. [2025-04-26 16:20:21,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-04-26 16:20:21,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 16:20:21,252 INFO L74 IsDeterministic]: Start isDeterministic. Operand 27 states and 47 transitions. [2025-04-26 16:20:21,252 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:21,252 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 47 transitions. [2025-04-26 16:20:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 47 transitions. [2025-04-26 16:20:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-26 16:20:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (in total 47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2025-04-26 16:20:21,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 47 transitions. [2025-04-26 16:20:21,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:21,296 INFO L438 stractBuchiCegarLoop]: Abstraction has 27 states and 47 transitions. [2025-04-26 16:20:21,296 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:21,296 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 47 transitions. [2025-04-26 16:20:21,297 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2025-04-26 16:20:21,297 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:21,297 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:21,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:21,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:21,298 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[34] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:21,298 INFO L754 eck$LassoCheckResult]: Loop: "[42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:21,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1800333628, now seen corresponding path program 1 times [2025-04-26 16:20:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779600343] [2025-04-26 16:20:21,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:21,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:21,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:21,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:21,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:21,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2025-04-26 16:20:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189797995] [2025-04-26 16:20:21,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:21,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:21,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:21,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,315 INFO L85 PathProgramCache]: Analyzing trace with hash -24232338, now seen corresponding path program 1 times [2025-04-26 16:20:21,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617890468] [2025-04-26 16:20:21,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:21,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:21,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,318 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:21,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:21,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:21,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:21,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:21,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:21,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:21,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,417 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:20:21,427 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:20:21,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 62 flow [2025-04-26 16:20:21,456 INFO L116 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-04-26 16:20:21,456 INFO L117 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-04-26 16:20:21,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 23. Up to 5 conditions per place. [2025-04-26 16:20:21,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 23 transitions, 62 flow [2025-04-26 16:20:21,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 62 flow [2025-04-26 16:20:21,461 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 23 transitions, 62 flow [2025-04-26 16:20:21,461 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:21,461 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:21,461 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:21,461 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:21,462 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:21,462 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:21,462 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:21,462 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:21,462 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:21,515 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 142 [2025-04-26 16:20:21,515 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:21,515 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:21,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:21,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:21,515 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:21,515 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 317 states, but on-demand construction may add more states [2025-04-26 16:20:21,523 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 142 [2025-04-26 16:20:21,523 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:21,523 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:21,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:21,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:21,523 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[49] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:20:21,524 INFO L754 eck$LassoCheckResult]: Loop: "[71] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[64] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[56] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[66] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[67] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[68] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[73] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_21) InVars {i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[55] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" [2025-04-26 16:20:21,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2684, now seen corresponding path program 1 times [2025-04-26 16:20:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391480597] [2025-04-26 16:20:21,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:21,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:21,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:21,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:21,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:21,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,530 INFO L85 PathProgramCache]: Analyzing trace with hash 9936979, now seen corresponding path program 1 times [2025-04-26 16:20:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777626575] [2025-04-26 16:20:21,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:21,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:21,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:21,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777626575] [2025-04-26 16:20:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777626575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:21,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834120017] [2025-04-26 16:20:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:21,559 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:21,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:21,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:21,560 INFO L87 Difference]: Start difference. First operand currently 317 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:21,612 INFO L93 Difference]: Finished difference Result 333 states and 866 transitions. [2025-04-26 16:20:21,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 333 states and 866 transitions. [2025-04-26 16:20:21,618 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 173 [2025-04-26 16:20:21,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 333 states to 320 states and 835 transitions. [2025-04-26 16:20:21,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2025-04-26 16:20:21,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2025-04-26 16:20:21,629 INFO L74 IsDeterministic]: Start isDeterministic. Operand 320 states and 835 transitions. [2025-04-26 16:20:21,630 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:21,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 320 states and 835 transitions. [2025-04-26 16:20:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 835 transitions. [2025-04-26 16:20:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 267. [2025-04-26 16:20:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 267 states have (on average 2.647940074906367) internal successors, (in total 707), 266 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 707 transitions. [2025-04-26 16:20:21,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 267 states and 707 transitions. [2025-04-26 16:20:21,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:21,654 INFO L438 stractBuchiCegarLoop]: Abstraction has 267 states and 707 transitions. [2025-04-26 16:20:21,654 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:21,654 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 267 states and 707 transitions. [2025-04-26 16:20:21,656 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 168 [2025-04-26 16:20:21,656 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:21,656 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:21,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:21,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:21,657 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[49] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[71] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[57] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" [2025-04-26 16:20:21,657 INFO L754 eck$LassoCheckResult]: Loop: "[55] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[72] L19-1-->$Ultimate##0: Formula: (= v_i_19 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_19} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_19} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0]" "[59] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[61] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[56] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[62] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[63] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[74] workerEXIT-->L21-2: Formula: (= v_i_23 (+ v_workerThread2of2ForFork0_thidvar0_4 1)) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} AuxVars[] AssignedVars[]" [2025-04-26 16:20:21,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2581582, now seen corresponding path program 1 times [2025-04-26 16:20:21,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67341374] [2025-04-26 16:20:21,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:21,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:21,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:21,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:21,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:21,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash 780773637, now seen corresponding path program 1 times [2025-04-26 16:20:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102223991] [2025-04-26 16:20:21,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:21,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:21,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:21,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:21,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102223991] [2025-04-26 16:20:21,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102223991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:21,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396372173] [2025-04-26 16:20:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:21,691 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:21,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:21,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:21,692 INFO L87 Difference]: Start difference. First operand 267 states and 707 transitions. cyclomatic complexity: 478 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:21,723 INFO L93 Difference]: Finished difference Result 314 states and 818 transitions. [2025-04-26 16:20:21,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 314 states and 818 transitions. [2025-04-26 16:20:21,726 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 156 [2025-04-26 16:20:21,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 314 states to 309 states and 804 transitions. [2025-04-26 16:20:21,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2025-04-26 16:20:21,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2025-04-26 16:20:21,729 INFO L74 IsDeterministic]: Start isDeterministic. Operand 309 states and 804 transitions. [2025-04-26 16:20:21,730 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:21,730 INFO L218 hiAutomatonCegarLoop]: Abstraction has 309 states and 804 transitions. [2025-04-26 16:20:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 804 transitions. [2025-04-26 16:20:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 272. [2025-04-26 16:20:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 272 states have (on average 2.599264705882353) internal successors, (in total 707), 271 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 707 transitions. [2025-04-26 16:20:21,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 272 states and 707 transitions. [2025-04-26 16:20:21,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:21,739 INFO L438 stractBuchiCegarLoop]: Abstraction has 272 states and 707 transitions. [2025-04-26 16:20:21,740 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:21,740 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 272 states and 707 transitions. [2025-04-26 16:20:21,741 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 156 [2025-04-26 16:20:21,741 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:21,741 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:21,742 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:21,742 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:21,742 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[49] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[71] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[57] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" [2025-04-26 16:20:21,742 INFO L754 eck$LassoCheckResult]: Loop: "[64] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[66] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[55] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[67] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[68] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[72] L19-1-->$Ultimate##0: Formula: (= v_i_19 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_19} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_19} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0]" "[59] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[56] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[61] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[62] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[63] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[73] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_21) InVars {i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[55] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[71] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[56] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[74] workerEXIT-->L21-2: Formula: (= v_i_23 (+ v_workerThread2of2ForFork0_thidvar0_4 1)) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} AuxVars[] AssignedVars[]" [2025-04-26 16:20:21,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2581582, now seen corresponding path program 2 times [2025-04-26 16:20:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388353616] [2025-04-26 16:20:21,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:21,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:21,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:20:21,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:21,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:21,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:21,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2048224541, now seen corresponding path program 1 times [2025-04-26 16:20:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:21,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105470409] [2025-04-26 16:20:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:21,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:20:21,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:20:21,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:21,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:20:21,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:20:21,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:21,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:21,773 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No thread ID for procedure ULTIMATE.start at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:218) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:115) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:175) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:74) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:441) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:377) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:353) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:847) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:767) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runSingleCegarLoop(BuchiAutomizerObserver.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:377) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-04-26 16:20:21,777 INFO L158 Benchmark]: Toolchain (without parser) took 1113.17ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 84.7MB in the beginning and 71.2MB in the end (delta: 13.5MB). Peak memory consumption was 1.9MB. Max. memory is 8.0GB. [2025-04-26 16:20:21,777 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.70ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:21,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.30ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:21,777 INFO L158 Benchmark]: Boogie Preprocessor took 21.48ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 982.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:21,778 INFO L158 Benchmark]: RCFGBuilder took 139.22ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 72.4MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:20:21,778 INFO L158 Benchmark]: BuchiAutomizer took 913.07ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.3MB in the beginning and 71.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:21,779 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.70ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.30ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.48ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 982.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 139.22ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 72.4MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 913.07ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.3MB in the beginning and 71.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 5 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No thread ID for procedure ULTIMATE.start de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No thread ID for procedure ULTIMATE.start: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:218) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-04-26 16:20:21,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...