/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:17:56,797 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:17:56,869 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:17:56,906 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:17:56,907 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:17:56,907 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:17:56,908 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:17:56,909 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:17:56,909 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:17:56,913 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:17:56,913 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:17:56,913 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:17:56,913 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:17:56,915 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:17:56,915 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:17:56,915 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:17:56,916 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:17:56,916 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:17:56,916 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:17:56,916 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:17:56,916 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:17:56,918 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:17:56,918 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:17:56,918 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:17:56,918 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:17:56,918 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:17:56,919 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:17:56,919 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:17:56,919 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:17:56,919 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:17:56,920 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:17:56,920 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:17:56,920 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:17:56,922 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:17:56,922 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:17:57,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:17:57,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:17:57,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:17:57,175 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:17:57,176 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:17:57,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl [2023-10-12 17:17:57,177 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl' [2023-10-12 17:17:57,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:17:57,198 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:17:57,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:17:57,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:17:57,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:17:57,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,226 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:17:57,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:17:57,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:17:57,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:17:57,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:17:57,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:17:57,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:17:57,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:17:57,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:17:57,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/1) ... [2023-10-12 17:17:57,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:17:57,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:17:57,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:17:57,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:17:57,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:17:57,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:17:57,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:17:57,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2023-10-12 17:17:57,363 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2023-10-12 17:17:57,363 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2023-10-12 17:17:57,364 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:17:57,412 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:17:57,414 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:17:57,489 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:17:57,495 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:17:57,495 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:17:57,497 INFO L201 PluginConnector]: Adding new model TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:17:57 BoogieIcfgContainer [2023-10-12 17:17:57,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:17:57,498 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:17:57,498 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:17:57,501 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:17:57,502 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:17:57,502 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:17:57" (1/2) ... [2023-10-12 17:17:57,504 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20ac99a5 and model type TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:17:57, skipping insertion in model container [2023-10-12 17:17:57,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:17:57,504 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:17:57" (2/2) ... [2023-10-12 17:17:57,505 INFO L332 chiAutomizerObserver]: Analyzing ICFG TwoActiveWorkersSirius.bpl [2023-10-12 17:17:57,549 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-10-12 17:17:57,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 40 flow [2023-10-12 17:17:57,593 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2023-10-12 17:17:57,593 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-10-12 17:17:57,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 19 events. 2/19 cut-off events. For 1/2 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 8. Up to 3 conditions per place. [2023-10-12 17:17:57,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 16 transitions, 40 flow [2023-10-12 17:17:57,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 16 transitions, 40 flow [2023-10-12 17:17:57,604 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:17:57,629 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 16 transitions, 40 flow [2023-10-12 17:17:57,632 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 16 transitions, 40 flow [2023-10-12 17:17:57,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 40 flow [2023-10-12 17:17:57,638 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2023-10-12 17:17:57,638 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-10-12 17:17:57,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 19 events. 2/19 cut-off events. For 1/2 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 8. Up to 3 conditions per place. [2023-10-12 17:17:57,639 INFO L119 LiptonReduction]: Number of co-enabled transitions 70 [2023-10-12 17:17:57,791 INFO L134 LiptonReduction]: Checked pairs total: 122 [2023-10-12 17:17:57,791 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:17:57,802 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:17:57,802 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:17:57,803 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:17:57,803 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:17:57,803 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:17:57,803 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:17:57,803 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:17:57,803 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:17:57,804 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 places, 12 transitions, 32 flow [2023-10-12 17:17:57,808 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:17:57,809 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-10-12 17:17:57,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:17:57,809 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:17:57,812 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:17:57,812 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 places, 12 transitions, 32 flow [2023-10-12 17:17:57,814 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:17:57,814 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-10-12 17:17:57,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:17:57,815 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:17:57,820 INFO L748 eck$LassoCheckResult]: Stem: 21#[$Ultimate##0]true [48] $Ultimate##0-->L19-1: Formula: (and (= v_c_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, c=v_c_24} AuxVars[] AssignedVars[i, c] 23#[L19-1]true [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] 25#[$Ultimate##0, L20]true [49] L20-->L19-1: Formula: (and (<= v_i_33 0) (= (+ v_i_33 1) v_i_32)) InVars {i=v_i_33} OutVars{i=v_i_32} AuxVars[] AssignedVars[i] 27#[$Ultimate##0, L19-1]true [41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 29#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2023-10-12 17:17:57,820 INFO L750 eck$LassoCheckResult]: Loop: 29#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 29#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2023-10-12 17:17:57,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:17:57,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2396372, now seen corresponding path program 1 times [2023-10-12 17:17:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:17:57,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478883716] [2023-10-12 17:17:57,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:17:57,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:17:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:57,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:17:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:57,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:17:57,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:17:57,919 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2023-10-12 17:17:57,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:17:57,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422969982] [2023-10-12 17:17:57,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:17:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:17:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:57,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:17:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:57,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:17:57,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:17:57,926 INFO L85 PathProgramCache]: Analyzing trace with hash 74287574, now seen corresponding path program 1 times [2023-10-12 17:17:57,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:17:57,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305927348] [2023-10-12 17:17:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:17:57,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:17:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:57,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:17:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:57,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:17:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:58,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:17:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:58,069 WARN L148 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:17:58,076 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:17:58,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 64 flow [2023-10-12 17:17:58,086 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:17:58,087 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2023-10-12 17:17:58,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 36 events. 4/36 cut-off events. For 5/7 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 25. Up to 5 conditions per place. [2023-10-12 17:17:58,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 23 transitions, 64 flow [2023-10-12 17:17:58,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 64 flow [2023-10-12 17:17:58,089 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:17:58,089 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 23 transitions, 64 flow [2023-10-12 17:17:58,089 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 23 transitions, 64 flow [2023-10-12 17:17:58,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 64 flow [2023-10-12 17:17:58,112 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:17:58,113 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2023-10-12 17:17:58,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 36 events. 4/36 cut-off events. For 5/7 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 25. Up to 5 conditions per place. [2023-10-12 17:17:58,115 INFO L119 LiptonReduction]: Number of co-enabled transitions 230 [2023-10-12 17:17:58,254 INFO L134 LiptonReduction]: Checked pairs total: 468 [2023-10-12 17:17:58,254 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:17:58,256 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:17:58,256 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:17:58,256 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:17:58,256 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:17:58,256 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:17:58,258 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:17:58,258 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:17:58,258 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:17:58,258 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 places, 19 transitions, 56 flow [2023-10-12 17:17:58,263 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:17:58,263 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-10-12 17:17:58,264 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2023-10-12 17:17:58,264 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:17:58,264 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:17:58,264 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 places, 19 transitions, 56 flow [2023-10-12 17:17:58,273 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:17:58,273 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-10-12 17:17:58,273 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2023-10-12 17:17:58,273 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:17:58,274 INFO L748 eck$LassoCheckResult]: Stem: 29#[$Ultimate##0]true [84] $Ultimate##0-->L19-1: Formula: (and (= v_i_84 0) (= v_c_93 0)) InVars {} OutVars{i=v_i_84, c=v_c_93} AuxVars[] AssignedVars[i, c] 31#[L19-1]true [77] L19-1-->$Ultimate##0: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 33#[L20, $Ultimate##0]true [85] L20-->L19-1: Formula: (and (= v_i_86 (+ v_i_87 1)) (<= v_i_87 0)) InVars {i=v_i_87} OutVars{i=v_i_86} AuxVars[] AssignedVars[i] 35#[L19-1, $Ultimate##0]true [78] L19-1-->$Ultimate##0: Formula: (= v_i_59 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_59} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_59} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0] 37#[$Ultimate##0, L20, $Ultimate##0]true [85] L20-->L19-1: Formula: (and (= v_i_86 (+ v_i_87 1)) (<= v_i_87 0)) InVars {i=v_i_87} OutVars{i=v_i_86} AuxVars[] AssignedVars[i] 39#[$Ultimate##0, L19-1, $Ultimate##0]true [75] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 41#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]true [2023-10-12 17:17:58,274 INFO L750 eck$LassoCheckResult]: Loop: 41#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]true [76] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 41#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]true [2023-10-12 17:17:58,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:17:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash -928893911, now seen corresponding path program 1 times [2023-10-12 17:17:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:17:58,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920796513] [2023-10-12 17:17:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:17:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:17:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:17:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:17:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:17:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920796513] [2023-10-12 17:17:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920796513] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:17:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:17:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:17:58,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754827192] [2023-10-12 17:17:58,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:17:58,333 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:17:58,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:17:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2023-10-12 17:17:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:17:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199347899] [2023-10-12 17:17:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:17:58,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:17:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:58,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:17:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:58,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:17:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:17:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:17:58,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:17:58,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:17:58,365 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:17:58,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:17:58,423 INFO L124 PetriNetUnfolderBase]: 95/183 cut-off events. [2023-10-12 17:17:58,423 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-10-12 17:17:58,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 183 events. 95/183 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 610 event pairs, 28 based on Foata normal form. 12/163 useless extension candidates. Maximal degree in co-relation 87. Up to 177 conditions per place. [2023-10-12 17:17:58,426 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2023-10-12 17:17:58,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 105 flow [2023-10-12 17:17:58,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 22 transitions, 105 flow [2023-10-12 17:17:58,444 INFO L124 PetriNetUnfolderBase]: 95/183 cut-off events. [2023-10-12 17:17:58,444 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-10-12 17:17:58,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 183 events. 95/183 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 609 event pairs, 28 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 87. Up to 177 conditions per place. [2023-10-12 17:17:58,445 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 22 places, 22 transitions, 105 flow [2023-10-12 17:17:58,447 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 22 places, 22 transitions, 105 flow [2023-10-12 17:17:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:17:58,451 INFO L430 stractBuchiCegarLoop]: Abstraction has has 22 places, 22 transitions, 105 flow [2023-10-12 17:17:58,451 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:17:58,451 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 22 transitions, 105 flow [2023-10-12 17:17:58,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:17:58,464 INFO L124 PetriNetUnfolderBase]: 57/110 cut-off events. [2023-10-12 17:17:58,464 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:17:58,464 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:17:58,469 INFO L748 eck$LassoCheckResult]: Stem: 29#[$Ultimate##0]true [84] $Ultimate##0-->L19-1: Formula: (and (= v_i_84 0) (= v_c_93 0)) InVars {} OutVars{i=v_i_84, c=v_c_93} AuxVars[] AssignedVars[i, c] 31#[L19-1]true [77] L19-1-->$Ultimate##0: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 33#[L20, $Ultimate##0]true [70] $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] 64#[L30, L20]true [72] 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[] 66#[L31, L20]true [83] L31-->workerEXIT: Formula: (= (+ v_c_89 v_i_82) v_c_90) InVars {i=v_i_82, c=v_c_90} OutVars{i=v_i_82, c=v_c_89} AuxVars[] AssignedVars[c] 68#[workerEXIT, L20]true [62] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 70#[L21, workerEXIT]true [79] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_61) InVars {i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[] 72#[L21-2]true [61] 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] 31#[L19-1]true [77] L19-1-->$Ultimate##0: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 33#[L20, $Ultimate##0]true [62] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 76#[L21, $Ultimate##0]true [2023-10-12 17:17:58,469 INFO L750 eck$LassoCheckResult]: Loop: 76#[L21, $Ultimate##0]true [70] $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] 79#[L21, L30]true [72] 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[] 81#[L31, L21]true [83] L31-->workerEXIT: Formula: (= (+ v_c_89 v_i_82) v_c_90) InVars {i=v_i_82, c=v_c_90} OutVars{i=v_i_82, c=v_c_89} AuxVars[] AssignedVars[c] 70#[L21, workerEXIT]true [79] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_61) InVars {i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[] 72#[L21-2]true [61] 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] 31#[L19-1]true [77] L19-1-->$Ultimate##0: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 33#[L20, $Ultimate##0]true [62] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 76#[L21, $Ultimate##0]true [2023-10-12 17:17:58,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:17:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash 790030374, now seen corresponding path program 1 times [2023-10-12 17:17:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:17:58,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652885256] [2023-10-12 17:17:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:17:58,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:17:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:17:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:17:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:17:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652885256] [2023-10-12 17:17:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652885256] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:17:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:17:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:17:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9796806] [2023-10-12 17:17:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:17:58,502 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:17:58,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:17:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1583924239, now seen corresponding path program 1 times [2023-10-12 17:17:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:17:58,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772975628] [2023-10-12 17:17:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:17:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:17:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:58,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:17:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:17:58,514 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:169) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:435) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:385) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:361) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) 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:881) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:843) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:763) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:361) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) 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) [2023-10-12 17:17:58,518 INFO L158 Benchmark]: Toolchain (without parser) took 1319.72ms. Allocated memory was 177.2MB in the beginning and 260.0MB in the end (delta: 82.8MB). Free memory was 132.5MB in the beginning and 199.1MB in the end (delta: -66.6MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2023-10-12 17:17:58,518 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 177.2MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:17:58,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.98ms. Allocated memory is still 177.2MB. Free memory was 132.3MB in the beginning and 130.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:17:58,519 INFO L158 Benchmark]: Boogie Preprocessor took 17.10ms. Allocated memory is still 177.2MB. Free memory was 130.9MB in the beginning and 129.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:17:58,520 INFO L158 Benchmark]: RCFGBuilder took 249.39ms. Allocated memory is still 177.2MB. Free memory was 129.8MB in the beginning and 121.2MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:17:58,520 INFO L158 Benchmark]: BuchiAutomizer took 1018.86ms. Allocated memory was 177.2MB in the beginning and 260.0MB in the end (delta: 82.8MB). Free memory was 121.1MB in the beginning and 199.1MB in the end (delta: -78.0MB). Peak memory consumption was 4.5MB. Max. memory is 8.0GB. [2023-10-12 17:17:58,523 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.26ms. Allocated memory is still 177.2MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.98ms. Allocated memory is still 177.2MB. Free memory was 132.3MB in the beginning and 130.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.10ms. Allocated memory is still 177.2MB. Free memory was 130.9MB in the beginning and 129.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.39ms. Allocated memory is still 177.2MB. Free memory was 129.8MB in the beginning and 121.2MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1018.86ms. Allocated memory was 177.2MB in the beginning and 260.0MB in the end (delta: 82.8MB). Free memory was 121.1MB in the beginning and 199.1MB in the end (delta: -78.0MB). Peak memory consumption was 4.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 17 PlacesBefore, 13 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 122 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 49, unknown conditional: 0, unknown unconditional: 49] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 21 PlacesAfterwards, 23 TransitionsBefore, 19 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 468 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, independent: 184, independent conditional: 0, independent unconditional: 184, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 124, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 124, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 124, unknown conditional: 0, unknown unconditional: 124] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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. [2023-10-12 17:17:58,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...