/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:44:33,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:44:34,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:44:34,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:44:34,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:44:34,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:44:34,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:44:34,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:44:34,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:44:34,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:44:34,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:44:34,071 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:44:34,071 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:44:34,071 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:44:34,072 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:44:34,072 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:44:34,072 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:44:34,073 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:44:34,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:44:34,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:44:34,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:44:34,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:44:34,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:44:34,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:44:34,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:44:34,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:44:34,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:44:34,076 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:44:34,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:44:34,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:44:34,076 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:44:34,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:44:34,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:44:34,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:44:34,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:44:34,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:44:34,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:44:34,079 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:44:34,079 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:44:34,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:44:34,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:44:34,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:44:34,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:44:34,509 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:44:34,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2024-02-10 00:44:35,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:44:36,119 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:44:36,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2024-02-10 00:44:36,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73501f21b/312d7006a4d14fa99d6d8e5325d4267b/FLAG0fb755aa4 [2024-02-10 00:44:36,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73501f21b/312d7006a4d14fa99d6d8e5325d4267b [2024-02-10 00:44:36,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:44:36,154 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:44:36,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:44:36,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:44:36,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:44:36,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e68af28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36, skipping insertion in model container [2024-02-10 00:44:36,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,219 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:44:36,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:44:36,414 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:44:36,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:44:36,456 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:44:36,456 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:44:36,463 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:44:36,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36 WrapperNode [2024-02-10 00:44:36,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:44:36,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:44:36,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:44:36,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:44:36,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,511 INFO L138 Inliner]: procedures = 27, calls = 76, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 178 [2024-02-10 00:44:36,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:44:36,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:44:36,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:44:36,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:44:36,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:44:36,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:44:36,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:44:36,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:44:36,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (1/1) ... [2024-02-10 00:44:36,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:36,591 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) [2024-02-10 00:44:36,595 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 [2024-02-10 00:44:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:44:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:44:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:44:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:44:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:44:36,653 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:44:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:44:36,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:44:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:44:36,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:44:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-10 00:44:36,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-10 00:44:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:44:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-02-10 00:44:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-02-10 00:44:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:44:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:44:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-10 00:44:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:44:36,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:44:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:44:36,689 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:44:36,792 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:44:36,794 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:44:37,229 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:44:37,370 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:44:37,371 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2024-02-10 00:44:37,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:44:37 BoogieIcfgContainer [2024-02-10 00:44:37,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:44:37,375 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:44:37,375 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:44:37,379 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:44:37,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:44:37,381 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:44:36" (1/3) ... [2024-02-10 00:44:37,382 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3199d921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:44:37, skipping insertion in model container [2024-02-10 00:44:37,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:44:37,383 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:44:36" (2/3) ... [2024-02-10 00:44:37,384 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3199d921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:44:37, skipping insertion in model container [2024-02-10 00:44:37,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:44:37,384 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:44:37" (3/3) ... [2024-02-10 00:44:37,385 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-min-max-inc-dec.wvr.c [2024-02-10 00:44:37,519 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-10 00:44:37,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 203 transitions, 441 flow [2024-02-10 00:44:37,629 INFO L124 PetriNetUnfolderBase]: 14/193 cut-off events. [2024-02-10 00:44:37,630 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-10 00:44:37,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 193 events. 14/193 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 150 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2024-02-10 00:44:37,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 203 transitions, 441 flow [2024-02-10 00:44:37,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 193 transitions, 416 flow [2024-02-10 00:44:37,663 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:44:37,663 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:44:37,664 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:44:37,664 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:44:37,664 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:44:37,664 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:44:37,664 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:44:37,664 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:44:37,665 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 195 places, 193 transitions, 416 flow [2024-02-10 00:44:37,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:44:37,697 INFO L124 PetriNetUnfolderBase]: 4/67 cut-off events. [2024-02-10 00:44:37,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:44:37,697 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:44:37,702 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:44:37,702 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 195 places, 193 transitions, 416 flow [2024-02-10 00:44:37,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:44:37,721 INFO L124 PetriNetUnfolderBase]: 4/67 cut-off events. [2024-02-10 00:44:37,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:44:37,721 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:44:37,730 INFO L748 eck$LassoCheckResult]: Stem: 204#[$Ultimate##0]true [406] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_31| 0) 0) InVars {#valid=|v_#valid_31|} OutVars{#valid=|v_#valid_31|} AuxVars[] AssignedVars[] 206#[L-1]true [417] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 208#[L21]true [518] L21-->L21-1: Formula: (and (= (select |v_#valid_32| 1) 1) (= 2 (select |v_#length_21| 1))) InVars {#length=|v_#length_21|, #valid=|v_#valid_32|} OutVars{#length=|v_#length_21|, #valid=|v_#valid_32|} AuxVars[] AssignedVars[] 210#[L21-1]true [541] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_26| 1) 0)) InVars {#memory_int=|v_#memory_int_26|} OutVars{#memory_int=|v_#memory_int_26|} AuxVars[] AssignedVars[] 212#[L21-2]true [430] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_27| 1) 1) 0) InVars {#memory_int=|v_#memory_int_27|} OutVars{#memory_int=|v_#memory_int_27|} AuxVars[] AssignedVars[] 214#[L21-3]true [494] L21-3-->L21-4: Formula: (and (= (select |v_#valid_33| 2) 1) (= 29 (select |v_#length_22| 2))) InVars {#length=|v_#length_22|, #valid=|v_#valid_33|} OutVars{#length=|v_#length_22|, #valid=|v_#valid_33|} AuxVars[] AssignedVars[] 216#[L21-4]true [468] L21-4-->L42: Formula: (and (= v_~A~0.offset_13 0) (= v_~A~0.base_13 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 218#[L42]true [450] L42-->L42-1: Formula: (= v_~min~0_7 0) InVars {} OutVars{~min~0=v_~min~0_7} AuxVars[] AssignedVars[~min~0] 220#[L42-1]true [542] L42-1-->L42-2: Formula: (= v_~max~0_7 0) InVars {} OutVars{~max~0=v_~max~0_7} AuxVars[] AssignedVars[~max~0] 222#[L42-2]true [465] L42-2-->L43: Formula: (= v_~N~0_9 0) InVars {} OutVars{~N~0=v_~N~0_9} AuxVars[] AssignedVars[~N~0] 224#[L43]true [548] L43-->L43-1: Formula: (= v_~v_assert~0_3 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[~v_assert~0] 226#[L43-1]true [410] L43-1-->L43-2: Formula: (= v_~b1~0_3 0) InVars {} OutVars{~b1~0=v_~b1~0_3} AuxVars[] AssignedVars[~b1~0] 228#[L43-2]true [439] L43-2-->L-1-1: Formula: (= v_~b2~0_3 0) InVars {} OutVars{~b2~0=v_~b2~0_3} AuxVars[] AssignedVars[~b2~0] 230#[L-1-1]true [558] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 232#[L-1-2]true [560] L-1-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret20#1.base=|v_ULTIMATE.start_main_#t~ret20#1.base_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_2|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_2|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_3|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_4|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_5|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_4|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_3|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_4|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t5~0#1.base=|v_ULTIMATE.start_main_~#t5~0#1.base_6|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_4|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_3|, ULTIMATE.start_main_~#t5~0#1.offset=|v_ULTIMATE.start_main_~#t5~0#1.offset_6|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_5|, ULTIMATE.start_main_#t~ret20#1.offset=|v_ULTIMATE.start_main_#t~ret20#1.offset_2|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_2|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_3|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret20#1.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_main_#t~pre25#1, ULTIMATE.start_main_#t~mem35#1, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~nondet26#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t5~0#1.base, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_~#t5~0#1.offset, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~ret20#1.offset, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet28#1] 234#[L115]true [451] L115-->L115-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_23|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_24|, #valid=|v_#valid_35|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 236#[L115-1]true [457] L115-1-->L115-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_25|) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_26|, #valid=|v_#valid_37|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 238#[L115-2]true [458] L115-2-->L115-3: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t3~0#1.base_7| 1)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_7|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t3~0#1.base_7| 4)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_7| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t3~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_7| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_28|, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_27|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_7|, #valid=|v_#valid_38|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 240#[L115-3]true [452] L115-3-->L115-4: Formula: (and (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t4~0#1.base_7| 4) |v_#length_29|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t4~0#1.base_7| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_7|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t4~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_7| 0)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_30|, #valid=|v_#valid_41|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_29|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_7|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_7|, #valid=|v_#valid_40|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 242#[L115-4]true [466] L115-4-->L115-5: Formula: (and (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t5~0#1.base_7| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t5~0#1.base_7|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t5~0#1.base_7|)) (< |v_#StackHeapBarrier_6| |v_ULTIMATE.start_main_~#t5~0#1.base_7|) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t5~0#1.base_7| 4) |v_#length_31|) (= |v_ULTIMATE.start_main_~#t5~0#1.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_32|, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_main_~#t5~0#1.offset=|v_ULTIMATE.start_main_~#t5~0#1.offset_7|, ULTIMATE.start_main_~#t5~0#1.base=|v_ULTIMATE.start_main_~#t5~0#1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_31|, #valid=|v_#valid_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t5~0#1.base, #valid, ULTIMATE.start_main_~#t5~0#1.offset, #length] 244#[L115-5]true [398] L115-5-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19#1] 246#[L117]true [375] L117-->L117-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19#1_4| v_~N~0_10) InVars {ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_4|} OutVars{~N~0=v_~N~0_10, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_4|} AuxVars[] AssignedVars[~N~0] 248#[L117-1]true [516] L117-1-->L118: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19#1] 250#[L118]true [509] L118-->L118-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (< 0 v_~N~0_11) 1 0)) InVars {~N~0=v_~N~0_11} OutVars{~N~0=v_~N~0_11, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 252#[L118-1]true [440] L118-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 254#[L37]true [453] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 256#[L38]true [470] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 258#[L37-1]true [454] L37-1-->L118-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 260#[L118-2]true [447] L118-2-->L119: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 262#[L119]true [544] L119-->L119-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_12) InVars {~N~0=v_~N~0_12} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 264#[L119-1]true [403] L119-1-->L119-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 266#[L119-2]true [425] L119-2-->L139: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet38#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet38#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post37#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~nondet38#1, ULTIMATE.start_create_fresh_int_array_#t~post37#1] 268#[L139]true [405] L139-->L140: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 270#[L140]true [446] L140-->L140-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 272#[L140-1]true [426] L140-1-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 274#[L37-2]true [390] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 276#[L38-3]true [414] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[] 278#[L37-3]true [407] L37-3-->L140-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 280#[L140-2]true [438] L140-2-->L141: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 282#[L141]true [427] L141-->L141-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 284#[L141-1]true [538] L141-1-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 286#[L37-4]true [533] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 288#[L38-6]true [514] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[] 290#[L37-5]true [488] L37-5-->L141-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 292#[L141-2]true [539] L141-2-->L143: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 294#[L143]true [519] L143-->L143-1: Formula: (and (= |v_#length_33| (store |v_#length_34| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824)))) (= 0 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_2|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2| |v_#StackHeapBarrier_7|) (= (store |v_#valid_45| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2| 1) |v_#valid_44|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2| 0)) (= (select |v_#valid_45| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #length=|v_#length_34|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_45|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2|, #valid=|v_#valid_44|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_2|, #length=|v_#length_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset, #length] 296#[L143-1]true [496] L143-1-->L143-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 298#[L143-2]true [379] L143-2-->L144: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset] 300#[L144]true [376] L144-->L144-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 302#[L144-6]true [2024-02-10 00:44:37,731 INFO L750 eck$LassoCheckResult]: Loop: 302#[L144-6]true [527] L144-6-->L145: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 305#[L145]true [456] L145-->L145-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet38#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet38#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet38#1] 307#[L145-1]true [471] L145-1-->L145-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse0) (select |v_#length_35| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_46| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (<= 0 .cse1) (= |v_#memory_int_28| (store |v_#memory_int_29| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_29| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet38#1_3|)))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_29|, #length=|v_#length_35|, ULTIMATE.start_create_fresh_int_array_#t~nondet38#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet38#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_create_fresh_int_array_#t~nondet38#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet38#1_3|} AuxVars[] AssignedVars[#memory_int] 309#[L145-2]true [437] L145-2-->L144-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet38#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet38#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet38#1] 311#[L144-3]true [483] L144-3-->L144-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post37#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post37#1] 313#[L144-4]true [415] L144-4-->L144-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post37#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post37#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 315#[L144-5]true [420] L144-5-->L144-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post37#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post37#1] 302#[L144-6]true [2024-02-10 00:44:37,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:44:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1990363964, now seen corresponding path program 1 times [2024-02-10 00:44:37,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:44:37,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964310777] [2024-02-10 00:44:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:44:37,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:44:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:44:37,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:44:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:44:38,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:44:38,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:44:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1924280432, now seen corresponding path program 1 times [2024-02-10 00:44:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:44:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495332713] [2024-02-10 00:44:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:44:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:44:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:44:38,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:44:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:44:38,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:44:38,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:44:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1066363469, now seen corresponding path program 1 times [2024-02-10 00:44:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:44:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675951671] [2024-02-10 00:44:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:44:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:44:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:44:38,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:44:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:44:38,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:44:40,695 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:44:40,696 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:44:40,696 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:44:40,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:44:40,697 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:44:40,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:40,697 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:44:40,697 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:44:40,698 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-min-max-inc-dec.wvr.c_BEv2_Iteration1_Lasso [2024-02-10 00:44:40,698 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:44:40,698 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:44:40,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:40,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:41,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:44:42,169 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:44:42,174 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:44:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,180 INFO L229 MonitoredProcess]: Starting monitored process 2 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) [2024-02-10 00:44:42,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:44:42,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:44:42,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:44:42,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 00:44:42,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,236 INFO L229 MonitoredProcess]: Starting monitored process 3 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) [2024-02-10 00:44:42,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:44:42,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:44:42,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:44:42,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 00:44:42,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,278 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2024-02-10 00:44:42,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 00:44:42,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,348 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2024-02-10 00:44:42,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:44:42,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:44:42,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:44:42,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 00:44:42,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,391 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2024-02-10 00:44:42,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:44:42,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:44:42,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:44:42,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 00:44:42,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,434 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2024-02-10 00:44:42,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 00:44:42,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,496 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2024-02-10 00:44:42,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 00:44:42,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,543 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2024-02-10 00:44:42,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:44:42,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:44:42,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:44:42,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 00:44:42,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,591 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2024-02-10 00:44:42,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:44:42,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:44:42,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:44:42,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 00:44:42,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,633 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2024-02-10 00:44:42,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:44:42,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,678 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2024-02-10 00:44:42,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:44:42,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,718 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2024-02-10 00:44:42,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:44:42,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,741 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 00:44:42,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,747 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-02-10 00:44:42,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,772 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2024-02-10 00:44:42,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:44:42,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,814 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2024-02-10 00:44:42,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:44:42,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,866 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2024-02-10 00:44:42,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 00:44:42,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,910 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2024-02-10 00:44:42,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 00:44:42,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,949 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-02-10 00:44:42,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:42,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:42,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:42,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:42,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:42,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:42,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:42,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 00:44:42,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:44:42,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:42,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:42,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:42,989 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-02-10 00:44:42,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:44:43,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:44:43,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:44:43,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:44:43,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:44:43,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:44:43,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:44:43,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 00:44:43,028 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:44:43,055 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-10 00:44:43,055 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-02-10 00:44:43,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:44:43,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:44:43,061 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-02-10 00:44:43,068 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:44:43,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-10 00:44:43,090 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:44:43,091 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:44:43,091 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~4#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2024-02-10 00:44:43,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:43,236 INFO L156 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2024-02-10 00:44:43,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:44:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:44:43,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:44:43,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:44:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:44:43,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:44:43,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:44:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:44:43,521 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-10 00:44:43,524 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) [2024-02-10 00:44:44,029 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) Result 13 states and 3689 transitions.8 powerset states5 rank states. The highest rank that occured is 1 [2024-02-10 00:44:44,030 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:44:44,031 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:44:44,033 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:44:44,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-02-10 00:44:44,215 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:44:44,215 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:44:44,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-10 00:44:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) [2024-02-10 00:44:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1395 transitions. [2024-02-10 00:44:44,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 1395 transitions. Stem has 49 letters. Loop has 7 letters. [2024-02-10 00:44:44,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:44:44,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 1395 transitions. Stem has 56 letters. Loop has 7 letters. [2024-02-10 00:44:44,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:44:44,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 1395 transitions. Stem has 49 letters. Loop has 14 letters. [2024-02-10 00:44:44,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:44:44,233 INFO L428 stractBuchiCegarLoop]: Abstraction has has 208 places, 3499 transitions, 14566 flow [2024-02-10 00:44:44,233 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:44:44,233 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 208 places, 3499 transitions, 14566 flow [2024-02-10 00:44:44,346 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:44:44,346 INFO L124 PetriNetUnfolderBase]: 130/370 cut-off events. [2024-02-10 00:44:44,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:44:44,347 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:44:44,349 INFO L748 eck$LassoCheckResult]: Stem: 204#[$Ultimate##0]true [406] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_31| 0) 0) InVars {#valid=|v_#valid_31|} OutVars{#valid=|v_#valid_31|} AuxVars[] AssignedVars[] 206#[L-1]true [417] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 208#[L21]true [518] L21-->L21-1: Formula: (and (= (select |v_#valid_32| 1) 1) (= 2 (select |v_#length_21| 1))) InVars {#length=|v_#length_21|, #valid=|v_#valid_32|} OutVars{#length=|v_#length_21|, #valid=|v_#valid_32|} AuxVars[] AssignedVars[] 210#[L21-1]true [541] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_26| 1) 0)) InVars {#memory_int=|v_#memory_int_26|} OutVars{#memory_int=|v_#memory_int_26|} AuxVars[] AssignedVars[] 212#[L21-2]true [430] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_27| 1) 1) 0) InVars {#memory_int=|v_#memory_int_27|} OutVars{#memory_int=|v_#memory_int_27|} AuxVars[] AssignedVars[] 214#[L21-3]true [494] L21-3-->L21-4: Formula: (and (= (select |v_#valid_33| 2) 1) (= 29 (select |v_#length_22| 2))) InVars {#length=|v_#length_22|, #valid=|v_#valid_33|} OutVars{#length=|v_#length_22|, #valid=|v_#valid_33|} AuxVars[] AssignedVars[] 216#[L21-4]true [468] L21-4-->L42: Formula: (and (= v_~A~0.offset_13 0) (= v_~A~0.base_13 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 218#[L42]true [450] L42-->L42-1: Formula: (= v_~min~0_7 0) InVars {} OutVars{~min~0=v_~min~0_7} AuxVars[] AssignedVars[~min~0] 220#[L42-1]true [542] L42-1-->L42-2: Formula: (= v_~max~0_7 0) InVars {} OutVars{~max~0=v_~max~0_7} AuxVars[] AssignedVars[~max~0] 222#[L42-2]true [465] L42-2-->L43: Formula: (= v_~N~0_9 0) InVars {} OutVars{~N~0=v_~N~0_9} AuxVars[] AssignedVars[~N~0] 224#[L43]true [548] L43-->L43-1: Formula: (= v_~v_assert~0_3 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[~v_assert~0] 226#[L43-1]true [410] L43-1-->L43-2: Formula: (= v_~b1~0_3 0) InVars {} OutVars{~b1~0=v_~b1~0_3} AuxVars[] AssignedVars[~b1~0] 228#[L43-2]true [439] L43-2-->L-1-1: Formula: (= v_~b2~0_3 0) InVars {} OutVars{~b2~0=v_~b2~0_3} AuxVars[] AssignedVars[~b2~0] 230#[L-1-1]true [558] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 232#[L-1-2]true [560] L-1-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret20#1.base=|v_ULTIMATE.start_main_#t~ret20#1.base_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_2|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_2|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_3|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_4|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_5|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_4|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_3|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_4|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t5~0#1.base=|v_ULTIMATE.start_main_~#t5~0#1.base_6|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_4|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_3|, ULTIMATE.start_main_~#t5~0#1.offset=|v_ULTIMATE.start_main_~#t5~0#1.offset_6|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_5|, ULTIMATE.start_main_#t~ret20#1.offset=|v_ULTIMATE.start_main_#t~ret20#1.offset_2|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_2|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_3|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret20#1.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_main_#t~pre25#1, ULTIMATE.start_main_#t~mem35#1, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~nondet26#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t5~0#1.base, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_~#t5~0#1.offset, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~ret20#1.offset, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet28#1] 234#[L115]true [451] L115-->L115-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_23|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_24|, #valid=|v_#valid_35|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 236#[L115-1]true [457] L115-1-->L115-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_25|) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_26|, #valid=|v_#valid_37|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 238#[L115-2]true [458] L115-2-->L115-3: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t3~0#1.base_7| 1)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_7|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t3~0#1.base_7| 4)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_7| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t3~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_7| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_28|, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_27|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_7|, #valid=|v_#valid_38|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 240#[L115-3]true [452] L115-3-->L115-4: Formula: (and (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t4~0#1.base_7| 4) |v_#length_29|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t4~0#1.base_7| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_7|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t4~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_7| 0)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_30|, #valid=|v_#valid_41|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_29|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_7|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_7|, #valid=|v_#valid_40|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 242#[L115-4]true [466] L115-4-->L115-5: Formula: (and (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t5~0#1.base_7| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t5~0#1.base_7|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t5~0#1.base_7|)) (< |v_#StackHeapBarrier_6| |v_ULTIMATE.start_main_~#t5~0#1.base_7|) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t5~0#1.base_7| 4) |v_#length_31|) (= |v_ULTIMATE.start_main_~#t5~0#1.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_32|, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_main_~#t5~0#1.offset=|v_ULTIMATE.start_main_~#t5~0#1.offset_7|, ULTIMATE.start_main_~#t5~0#1.base=|v_ULTIMATE.start_main_~#t5~0#1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_31|, #valid=|v_#valid_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t5~0#1.base, #valid, ULTIMATE.start_main_~#t5~0#1.offset, #length] 244#[L115-5]true [398] L115-5-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19#1] 246#[L117]true [375] L117-->L117-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19#1_4| v_~N~0_10) InVars {ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_4|} OutVars{~N~0=v_~N~0_10, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_4|} AuxVars[] AssignedVars[~N~0] 248#[L117-1]true [516] L117-1-->L118: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19#1] 250#[L118]true [509] L118-->L118-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (< 0 v_~N~0_11) 1 0)) InVars {~N~0=v_~N~0_11} OutVars{~N~0=v_~N~0_11, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 252#[L118-1]true [440] L118-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 254#[L37]true [453] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 256#[L38]true [470] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 258#[L37-1]true [454] L37-1-->L118-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 260#[L118-2]true [447] L118-2-->L119: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 262#[L119]true [544] L119-->L119-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_12) InVars {~N~0=v_~N~0_12} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 264#[L119-1]true [403] L119-1-->L119-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 266#[L119-2]true [425] L119-2-->L139: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet38#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet38#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post37#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~nondet38#1, ULTIMATE.start_create_fresh_int_array_#t~post37#1] 268#[L139]true [405] L139-->L140: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 270#[L140]true [446] L140-->L140-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 272#[L140-1]true [426] L140-1-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 274#[L37-2]true [390] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 276#[L38-3]true [414] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[] 278#[L37-3]true [407] L37-3-->L140-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 280#[L140-2]true [438] L140-2-->L141: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 282#[L141]true [427] L141-->L141-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 284#[L141-1]true [538] L141-1-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 286#[L37-4]true [533] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 288#[L38-6]true [514] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[] 290#[L37-5]true [488] L37-5-->L141-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 292#[L141-2]true [539] L141-2-->L143: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 294#[L143]true [519] L143-->L143-1: Formula: (and (= |v_#length_33| (store |v_#length_34| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824)))) (= 0 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_2|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2| |v_#StackHeapBarrier_7|) (= (store |v_#valid_45| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2| 1) |v_#valid_44|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2| 0)) (= (select |v_#valid_45| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #length=|v_#length_34|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_45|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_2|, #valid=|v_#valid_44|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_2|, #length=|v_#length_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset, #length] 296#[L143-1]true [496] L143-1-->L143-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 298#[L143-2]true [379] L143-2-->L144: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset] 300#[L144]true [376] L144-->L144-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 302#[L144-6]true [528] L144-6-->L144-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 768#[L144-7]true [484] L144-7-->L147: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 770#[L147]true [540] L147-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 772#[create_fresh_int_array_returnLabel#1]true [537] create_fresh_int_array_returnLabel#1-->L119-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret20#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_main_#t~ret20#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret20#1.offset=|v_ULTIMATE.start_main_#t~ret20#1.offset_3|, ULTIMATE.start_main_#t~ret20#1.base=|v_ULTIMATE.start_main_#t~ret20#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret20#1.base, ULTIMATE.start_main_#t~ret20#1.offset] 774#[L119-3]true [521] L119-3-->L119-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_create_fresh_int_array_#t~nondet38#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet38#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post37#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post37#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~nondet38#1, ULTIMATE.start_create_fresh_int_array_#t~post37#1] 776#[L119-4]true [481] L119-4-->L119-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 778#[L119-5]true [497] L119-5-->L119-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret20#1.offset_4| v_~A~0.offset_14) (= |v_ULTIMATE.start_main_#t~ret20#1.base_4| v_~A~0.base_14)) InVars {ULTIMATE.start_main_#t~ret20#1.base=|v_ULTIMATE.start_main_#t~ret20#1.base_4|, ULTIMATE.start_main_#t~ret20#1.offset=|v_ULTIMATE.start_main_#t~ret20#1.offset_4|} OutVars{~A~0.base=v_~A~0.base_14, ULTIMATE.start_main_#t~ret20#1.offset=|v_ULTIMATE.start_main_#t~ret20#1.offset_4|, ~A~0.offset=v_~A~0.offset_14, ULTIMATE.start_main_#t~ret20#1.base=|v_ULTIMATE.start_main_#t~ret20#1.base_4|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 780#[L119-6]true [409] L119-6-->L122: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret20#1.base=|v_ULTIMATE.start_main_#t~ret20#1.base_5|, ULTIMATE.start_main_#t~ret20#1.offset=|v_ULTIMATE.start_main_#t~ret20#1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret20#1.base, ULTIMATE.start_main_#t~ret20#1.offset] 782#[L122]true [433] L122-->L122-1: Formula: (= |v_#pthreadsForks_10| |v_ULTIMATE.start_main_#t~pre21#1_3|) InVars {#pthreadsForks=|v_#pthreadsForks_10|} OutVars{#pthreadsForks=|v_#pthreadsForks_10|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre21#1] 784#[L122-1]true [421] L122-1-->L122-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks] 786#[L122-2]true [524] L122-2-->L122-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_7|) (= |v_#memory_int_30| (store |v_#memory_int_31| |v_ULTIMATE.start_main_~#t1~0#1.base_7| (store (select |v_#memory_int_31| |v_ULTIMATE.start_main_~#t1~0#1.base_7|) |v_ULTIMATE.start_main_~#t1~0#1.offset_7| |v_ULTIMATE.start_main_#t~pre21#1_4|))) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_7| 4) (select |v_#length_36| |v_ULTIMATE.start_main_~#t1~0#1.base_7|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1~0#1.base_7|) 1)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_4|, #length=|v_#length_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_7|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_7|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_4|, #length=|v_#length_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_7|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_7|} AuxVars[] AssignedVars[#memory_int] 788#[L122-3]true [629] L122-3-->$Ultimate##0: Formula: (and (= v_thread1Thread1of1ForFork3_thidvar1_2 0) (= v_thread1Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre21#1_7|)) InVars {ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_7|} OutVars{thread1Thread1of1ForFork3_#res.base=|v_thread1Thread1of1ForFork3_#res.base_4|, thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_#res.offset=|v_thread1Thread1of1ForFork3_#res.offset_4|, thread1Thread1of1ForFork3_thidvar1=v_thread1Thread1of1ForFork3_thidvar1_2, thread1Thread1of1ForFork3_#t~mem1=|v_thread1Thread1of1ForFork3_#t~mem1_4|, thread1Thread1of1ForFork3_#t~mem3=|v_thread1Thread1of1ForFork3_#t~mem3_4|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_16, thread1Thread1of1ForFork3_#t~mem4=|v_thread1Thread1of1ForFork3_#t~mem4_4|, thread1Thread1of1ForFork3_#t~ite5=|v_thread1Thread1of1ForFork3_#t~ite5_4|, thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_8|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res.base, thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_#res.offset, thread1Thread1of1ForFork3_thidvar1, thread1Thread1of1ForFork3_#t~mem1, thread1Thread1of1ForFork3_#t~mem3, thread1Thread1of1ForFork3_~i~0, thread1Thread1of1ForFork3_#t~mem4, thread1Thread1of1ForFork3_#t~ite5, thread1Thread1of1ForFork3_#t~post2] 790#[L122-4, $Ultimate##0]true [567] $Ultimate##0-->L51: Formula: (and (<= 0 v_~A~0.offset_25) (= (select (select |v_#memory_int_46| v_~A~0.base_25) v_~A~0.offset_25) v_~min~0_12) (<= (+ v_~A~0.offset_25 4) (select |v_#length_48| v_~A~0.base_25)) (= (select |v_#valid_59| v_~A~0.base_25) 1)) InVars {#memory_int=|v_#memory_int_46|, ~A~0.base=v_~A~0.base_25, #length=|v_#length_48|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_59|} OutVars{~A~0.base=v_~A~0.base_25, ~A~0.offset=v_~A~0.offset_25, thread1Thread1of1ForFork3_#t~mem1=|v_thread1Thread1of1ForFork3_#t~mem1_1|, ~min~0=v_~min~0_12, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_46|, #length=|v_#length_48|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~mem1, ~min~0] 792#[L51, L122-4]true [568] L51-->L55: Formula: (= v_~b1~0_1 1) InVars {} OutVars{~b1~0=v_~b1~0_1} AuxVars[] AssignedVars[~b1~0] 794#[L55, L122-4]true [569] L55-->L57-4: Formula: (= v_thread1Thread1of1ForFork3_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0] 796#[L57-4, L122-4]true [2024-02-10 00:44:44,349 INFO L750 eck$LassoCheckResult]: Loop: 796#[L57-4, L122-4]true [570] L57-4-->L58: Formula: (< v_thread1Thread1of1ForFork3_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 799#[L58, L122-4]true [573] L58-->L60: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork3_~i~0_7 4))) (let ((.cse4 (+ v_~A~0.offset_65 .cse5))) (let ((.cse0 (= (select |v_#valid_99| v_~A~0.base_65) 1)) (.cse1 (<= (+ v_~A~0.offset_65 4 .cse5) (select |v_#length_88| v_~A~0.base_65))) (.cse3 (<= 0 .cse4))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_102| v_~A~0.base_65) .cse4))) (or (and (= |v_thread1Thread1of1ForFork3_#t~mem4_1| |v_thread1_#t~mem4_24|) (< v_~min~0_27 .cse2) (= v_~min~0_27 v_~min~0_26)) (and (= v_~min~0_26 |v_thread1_#t~mem4_24|) .cse0 .cse1 (= |v_thread1_#t~mem4_24| .cse2) .cse3 (<= .cse2 v_~min~0_27)))) .cse3)))) InVars {~A~0.base=v_~A~0.base_65, ~A~0.offset=v_~A~0.offset_65, ~min~0=v_~min~0_27, #valid=|v_#valid_99|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_7, thread1Thread1of1ForFork3_#t~mem4=|v_thread1Thread1of1ForFork3_#t~mem4_1|, #memory_int=|v_#memory_int_102|, #length=|v_#length_88|} OutVars{~A~0.base=v_~A~0.base_65, ~A~0.offset=v_~A~0.offset_65, thread1Thread1of1ForFork3_#t~mem3=|v_thread1Thread1of1ForFork3_#t~mem3_1|, ~min~0=v_~min~0_26, #valid=|v_#valid_99|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_7, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork3_#t~ite5=|v_thread1Thread1of1ForFork3_#t~ite5_1|, #length=|v_#length_88|} AuxVars[|v_thread1_#t~mem4_24|] AssignedVars[thread1Thread1of1ForFork3_#t~mem3, ~min~0, thread1Thread1of1ForFork3_#t~ite5, thread1Thread1of1ForFork3_#t~mem4] 801#[L122-4, L60]true [575] L60-->L57-2: Formula: (= v_thread1Thread1of1ForFork3_~i~0_11 |v_thread1Thread1of1ForFork3_#t~post2_1|) InVars {thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_11} OutVars{thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_1|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post2] 803#[L122-4, L57-2]true [577] L57-2-->L57-3: Formula: (= (+ |v_thread1Thread1of1ForFork3_#t~post2_3| 1) v_thread1Thread1of1ForFork3_~i~0_13) InVars {thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_3|} OutVars{thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_3|, thread1Thread1of1ForFork3_~i~0=v_thread1Thread1of1ForFork3_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_~i~0] 805#[L57-3, L122-4]true [579] L57-3-->L57-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork3_#t~post2=|v_thread1Thread1of1ForFork3_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post2] 796#[L57-4, L122-4]true [2024-02-10 00:44:44,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:44:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1846117274, now seen corresponding path program 1 times [2024-02-10 00:44:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:44:44,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355070409] [2024-02-10 00:44:44,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:44:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:44:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:44:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:44:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:44:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355070409] [2024-02-10 00:44:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355070409] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:44:44,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:44:44,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-10 00:44:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23214352] [2024-02-10 00:44:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:44:44,692 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-10 00:44:44,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:44:44,693 INFO L85 PathProgramCache]: Analyzing trace with hash 572677405, now seen corresponding path program 1 times [2024-02-10 00:44:44,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:44:44,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168942856] [2024-02-10 00:44:44,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:44:44,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:44:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:44:44,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:44:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:44:44,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:44:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:44:44,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-10 00:44:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-02-10 00:44:46,786 INFO L175 Difference]: Start difference. First operand has 208 places, 3499 transitions, 14566 flow. Second operand 31 states and 6293 transitions. [2024-02-10 00:44:46,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 3499 transitions, 14566 flow. Second operand 31 states and 6293 transitions. [2024-02-10 00:44:46,791 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 203 [2024-02-10 00:44:46,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand