/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/test-context1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:55:08,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:55:08,228 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:55:08,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:55:08,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:55:08,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:55:08,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:55:08,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:55:08,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:55:08,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:55:08,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:55:08,434 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:55:08,434 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:55:08,434 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:55:08,434 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:55:08,435 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:55:08,435 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:55:08,435 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:55:08,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:55:08,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:55:08,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:55:08,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:55:08,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:55:08,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:55:08,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:55:08,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:55:08,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:55:08,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:55:08,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:55:08,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:55:08,448 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:55:08,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:55:08,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:55:08,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:55:08,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:55:08,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:55:08,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:55:08,449 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:55:08,449 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:55:08,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:55:09,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:55:09,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:55:09,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:55:09,036 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:55:09,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-context1.wvr.c [2024-02-10 00:55:11,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:55:11,414 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:55:11,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c [2024-02-10 00:55:11,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c302b2763/4ed5f1b072224e57b18e31e9e2d9ba81/FLAG0f24c6570 [2024-02-10 00:55:11,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c302b2763/4ed5f1b072224e57b18e31e9e2d9ba81 [2024-02-10 00:55:11,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:55:11,488 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:55:11,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:55:11,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:55:11,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:55:11,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:11,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d517cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11, skipping insertion in model container [2024-02-10 00:55:11,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:11,571 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:55:11,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:55:11,862 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:55:11,903 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:55:11,913 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:55:11,914 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:55:11,937 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:55:11,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11 WrapperNode [2024-02-10 00:55:11,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:55:11,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:55:11,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:55:11,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:55:11,952 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:55:11" (1/1) ... [2024-02-10 00:55:11,986 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:55:11" (1/1) ... [2024-02-10 00:55:12,055 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 135 [2024-02-10 00:55:12,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:55:12,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:55:12,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:55:12,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:55:12,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:55:12,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:55:12,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:55:12,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:55:12,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (1/1) ... [2024-02-10 00:55:12,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:12,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:12,214 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:55:12,240 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:55:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:55:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:55:12,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:55:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:55:12,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:55:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:55:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:55:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:55:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:55:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:55:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-10 00:55:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:55:12,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:55:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:55:12,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:55:12,380 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:55:12,603 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:55:12,605 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:55:12,889 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:55:13,113 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:55:13,114 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-10 00:55:13,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:55:13 BoogieIcfgContainer [2024-02-10 00:55:13,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:55:13,146 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:55:13,146 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:55:13,150 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:55:13,151 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:13,151 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:55:11" (1/3) ... [2024-02-10 00:55:13,152 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@92ca3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:55:13, skipping insertion in model container [2024-02-10 00:55:13,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:13,152 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:11" (2/3) ... [2024-02-10 00:55:13,152 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@92ca3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:55:13, skipping insertion in model container [2024-02-10 00:55:13,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:13,152 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:55:13" (3/3) ... [2024-02-10 00:55:13,154 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-context1.wvr.c [2024-02-10 00:55:13,276 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:55:13,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 119 transitions, 252 flow [2024-02-10 00:55:13,379 INFO L124 PetriNetUnfolderBase]: 9/115 cut-off events. [2024-02-10 00:55:13,379 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:55:13,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 115 events. 9/115 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2024-02-10 00:55:13,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 119 transitions, 252 flow [2024-02-10 00:55:13,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 115 transitions, 242 flow [2024-02-10 00:55:13,401 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:55:13,401 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:55:13,401 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:55:13,401 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:55:13,401 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:55:13,402 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:55:13,402 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:55:13,402 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:55:13,403 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 113 places, 115 transitions, 242 flow [2024-02-10 00:55:13,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:13,431 INFO L124 PetriNetUnfolderBase]: 3/56 cut-off events. [2024-02-10 00:55:13,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:55:13,431 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:13,436 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:55:13,436 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 113 places, 115 transitions, 242 flow [2024-02-10 00:55:13,454 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:13,455 INFO L124 PetriNetUnfolderBase]: 3/56 cut-off events. [2024-02-10 00:55:13,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:55:13,455 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:13,467 INFO L748 eck$LassoCheckResult]: Stem: 119#[$Ultimate##0]true [278] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 121#[L-1]true [286] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 123#[L21]true [343] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 125#[L21-1]true [358] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 127#[L21-2]true [295] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 129#[L21-3]true [333] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 20) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 131#[L21-4]true [311] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 133#[L42]true [301] L42-->L42-1: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 135#[L42-1]true [359] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 137#[L42-2]true [309] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 139#[L42-3]true [274] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 141#[L-1-1]true [367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 143#[L-1-2]true [369] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 145#[L72]true [314] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 147#[L72-1]true [318] L72-1-->L72-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 149#[L72-2]true [265] L72-2-->L75: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 151#[L75]true [305] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 153#[L75-1]true [277] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[~n~0] 155#[L75-2]true [357] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 157#[L76]true [315] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 159#[L76-1]true [356] L76-1-->L76-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] 161#[L76-2]true [362] L76-2-->L90: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 163#[L90]true [363] L90-->L91: 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] 165#[L91]true [275] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 167#[L91-1]true [281] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 169#[L37]true [302] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 171#[L38]true [313] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 173#[L37-1]true [303] L37-1-->L91-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 175#[L91-2]true [317] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 177#[L92]true [350] L92-->L92-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_4|) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 179#[L92-1]true [345] L92-1-->L37-2: 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] 181#[L37-2]true [271] L37-2-->L38-3: 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] 183#[L38-3]true [283] L38-3-->L37-3: 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[] 185#[L37-3]true [279] L37-3-->L92-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] 187#[L92-2]true [307] L92-2-->L94: 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] 189#[L94]true [360] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 191#[L94-1]true [328] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 193#[L94-2]true [346] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 195#[L95]true [336] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 197#[L95-6]true [2024-02-10 00:55:13,470 INFO L750 eck$LassoCheckResult]: Loop: 197#[L95-6]true [323] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 200#[L96]true [351] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 202#[L96-1]true [319] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse0) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 204#[L96-2]true [273] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 206#[L95-3]true [354] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 208#[L95-4]true [293] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 210#[L95-5]true [260] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 197#[L95-6]true [2024-02-10 00:55:13,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1543642064, now seen corresponding path program 1 times [2024-02-10 00:55:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:13,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902028985] [2024-02-10 00:55:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:13,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:13,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:13,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:13,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1889293742, now seen corresponding path program 1 times [2024-02-10 00:55:13,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:13,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943557264] [2024-02-10 00:55:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:13,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:13,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:13,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:13,998 INFO L85 PathProgramCache]: Analyzing trace with hash -873433181, now seen corresponding path program 1 times [2024-02-10 00:55:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:13,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895540084] [2024-02-10 00:55:13,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:14,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:14,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:15,306 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:55:15,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:55:15,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:55:15,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:55:15,345 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:55:15,345 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:15,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:55:15,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:55:15,346 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_BEv2_Iteration1_Lasso [2024-02-10 00:55:15,346 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:55:15,346 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:55:15,408 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:55:15,431 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:55:15,433 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:55:15,436 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:55:15,438 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:55:15,440 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:55:15,442 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:55:15,445 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:55:15,448 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:55:15,450 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:55:15,452 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:55:15,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:55:15,459 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:55:15,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:55:15,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:55:15,467 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:55:15,469 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:55:15,844 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:55:15,847 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:55:15,851 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:55:15,854 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:55:15,856 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:55:15,859 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:55:15,861 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:55:15,864 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:55:15,866 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:55:15,868 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:55:15,870 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:55:15,872 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:55:15,874 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:55:16,449 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:55:16,454 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:55:16,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:16,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:16,492 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:55:16,547 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:55:16,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:16,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:16,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:16,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:16,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:16,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:16,580 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:55:16,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:16,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 00:55:16,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:16,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:16,618 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:55:16,661 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:55:16,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:16,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:16,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:16,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:16,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:16,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:16,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:16,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:16,712 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:55:16,712 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:55:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:16,732 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:55:16,780 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:55:16,791 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:55:16,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:16,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:16,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:16,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:16,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:16,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:16,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:16,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 00:55:16,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:16,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:16,849 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:55:16,876 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:55:16,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:16,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:16,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:16,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:16,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:16,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:16,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:16,896 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:55:16,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:16,940 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:55:16,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:16,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:16,964 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:55:17,006 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:55:17,007 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:55:17,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:17,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:17,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:17,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,028 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:55:17,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,031 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:55:17,039 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:55:17,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:17,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:17,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:17,071 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:55:17,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,111 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:55:17,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,129 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:55:17,169 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:55:17,178 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:55:17,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:17,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:17,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,228 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:55:17,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,248 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:55:17,296 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:55:17,298 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:55:17,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:17,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:17,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:17,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,340 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:55:17,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,356 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:55:17,381 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:55:17,383 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:55:17,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:17,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:17,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,456 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:55:17,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,466 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:55:17,476 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:55:17,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:17,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:17,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:17,489 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:55:17,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,516 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:55:17,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,529 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:55:17,560 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:55:17,561 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:55:17,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:17,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:17,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 00:55:17,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,633 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:55:17,680 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:55:17,681 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:55:17,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:17,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:17,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,735 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:55:17,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,744 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:55:17,753 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:55:17,764 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:55:17,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:17,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:17,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,820 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:55:17,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,837 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:55:17,908 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:55:17,910 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:55:17,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:17,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:17,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:17,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:17,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:17,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:17,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:17,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:17,959 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:55:17,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:17,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:17,967 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:55:17,996 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:55:18,012 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:55:18,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:18,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:18,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:18,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:18,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:18,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:18,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:18,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:18,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-02-10 00:55:18,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:18,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:18,084 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:55:18,155 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:55:18,160 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:55:18,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:18,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:18,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:18,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:18,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:18,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:18,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:18,208 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:55:18,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:18,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:18,224 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:55:18,240 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:55:18,242 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:55:18,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:18,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:18,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:18,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:18,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:18,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:18,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:18,308 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:55:18,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:18,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:18,328 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:55:18,352 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:55:18,353 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:55:18,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:18,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:18,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:18,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:18,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:18,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:18,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:18,417 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:55:18,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:18,419 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:55:18,430 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:55:18,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:18,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:18,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:18,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:18,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:18,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:18,459 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:55:18,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:18,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-02-10 00:55:18,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:18,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:18,516 INFO L229 MonitoredProcess]: Starting monitored process 21 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:55:18,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-10 00:55:18,565 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:55:18,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:18,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:18,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:18,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:18,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:18,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:18,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:55:18,752 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-02-10 00:55:18,752 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-10 00:55:18,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:18,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:18,776 INFO L229 MonitoredProcess]: Starting monitored process 22 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:55:18,808 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:55:18,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-10 00:55:18,860 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:55:18,861 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:55:18,861 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~0#1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 Supporting invariants [] [2024-02-10 00:55:18,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:19,002 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2024-02-10 00:55:19,012 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated [2024-02-10 00:55:19,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:19,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:55:19,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:55:19,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:55:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:55:19,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-10 00:55:19,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:55:19,356 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:55:19,429 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:55:19,432 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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:55:20,055 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 2113 transitions.8 powerset states5 rank states. The highest rank that occured is 1 [2024-02-10 00:55:20,056 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:55:20,056 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:55:20,058 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:55:20,207 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:55:20,207 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:55:20,226 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:55:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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:55:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 796 transitions. [2024-02-10 00:55:20,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 796 transitions. Stem has 39 letters. Loop has 7 letters. [2024-02-10 00:55:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 796 transitions. Stem has 46 letters. Loop has 7 letters. [2024-02-10 00:55:20,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:20,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 796 transitions. Stem has 39 letters. Loop has 14 letters. [2024-02-10 00:55:20,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:20,243 INFO L428 stractBuchiCegarLoop]: Abstraction has has 126 places, 2037 transitions, 8376 flow [2024-02-10 00:55:20,244 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:55:20,244 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 126 places, 2037 transitions, 8376 flow [2024-02-10 00:55:20,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:20,372 INFO L124 PetriNetUnfolderBase]: 78/243 cut-off events. [2024-02-10 00:55:20,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:55:20,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:20,374 INFO L748 eck$LassoCheckResult]: Stem: 119#[$Ultimate##0]true [278] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 121#[L-1]true [286] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 123#[L21]true [343] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 125#[L21-1]true [358] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 127#[L21-2]true [295] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 129#[L21-3]true [333] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 20) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 131#[L21-4]true [311] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 133#[L42]true [301] L42-->L42-1: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 135#[L42-1]true [359] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 137#[L42-2]true [309] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 139#[L42-3]true [274] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 141#[L-1-1]true [367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 143#[L-1-2]true [369] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 145#[L72]true [314] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 147#[L72-1]true [318] L72-1-->L72-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 149#[L72-2]true [265] L72-2-->L75: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 151#[L75]true [305] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 153#[L75-1]true [277] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[~n~0] 155#[L75-2]true [357] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 157#[L76]true [315] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 159#[L76-1]true [356] L76-1-->L76-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] 161#[L76-2]true [362] L76-2-->L90: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 163#[L90]true [363] L90-->L91: 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] 165#[L91]true [275] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 167#[L91-1]true [281] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 169#[L37]true [302] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 171#[L38]true [313] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 173#[L37-1]true [303] L37-1-->L91-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 175#[L91-2]true [317] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 177#[L92]true [350] L92-->L92-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_4|) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 179#[L92-1]true [345] L92-1-->L37-2: 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] 181#[L37-2]true [271] L37-2-->L38-3: 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] 183#[L38-3]true [283] L38-3-->L37-3: 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[] 185#[L37-3]true [279] L37-3-->L92-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] 187#[L92-2]true [307] L92-2-->L94: 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] 189#[L94]true [360] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 191#[L94-1]true [328] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 193#[L94-2]true [346] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 195#[L95]true [336] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 197#[L95-6]true [324] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 529#[L95-7]true [269] L95-7-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 531#[L98]true [344] L98-->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] 533#[create_fresh_int_array_returnLabel#1]true [352] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) 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~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 535#[L76-3]true [266] L76-3-->L76-4: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 537#[L76-4]true [320] L76-4-->L76-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] 539#[L76-5]true [364] L76-5-->L76-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 541#[L76-6]true [261] L76-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 543#[L79]true [298] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 545#[L79-1]true [353] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 547#[L79-2]true [280] L79-2-->L79-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 549#[L79-3]true [398] L79-3-->L53: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 551#[L79-4, L53]true [2024-02-10 00:55:20,375 INFO L750 eck$LassoCheckResult]: Loop: 551#[L79-4, L53]true [375] L53-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 554#[L79-4, L48]true [378] L48-->L48-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 556#[L79-4, L48-3]true [381] L48-3-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 558#[L79-4, L49]true [383] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_48 4)) (.cse2 (* v_~size~0_52 4))) (let ((.cse3 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (= (select |v_#valid_39| v_~queue~0.base_23) 1) (not (= (ite (let ((.cse0 (+ v_~front~0_48 v_~size~0_52))) (and (<= 0 .cse0) (< .cse0 v_~n~0_22))) 1 0) 0)) (= (+ v_~size~0_52 1) v_~size~0_51) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (<= 0 .cse3) (not (= (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse3) 5) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_52, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_22, ~front~0=v_~front~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_51, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_22, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 551#[L79-4, L53]true [2024-02-10 00:55:20,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -488236899, now seen corresponding path program 1 times [2024-02-10 00:55:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131384322] [2024-02-10 00:55:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:20,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:20,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:20,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 12470598, now seen corresponding path program 1 times [2024-02-10 00:55:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:20,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440912927] [2024-02-10 00:55:20,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:20,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:20,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:20,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1533981666, now seen corresponding path program 1 times [2024-02-10 00:55:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:20,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940664340] [2024-02-10 00:55:20,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:20,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:55:21,008 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:55:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:55:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940664340] [2024-02-10 00:55:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940664340] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:55:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:55:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-10 00:55:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156178515] [2024-02-10 00:55:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:55:21,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:55:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-10 00:55:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-10 00:55:21,725 INFO L175 Difference]: Start difference. First operand has 126 places, 2037 transitions, 8376 flow. Second operand 15 states and 1785 transitions. [2024-02-10 00:55:21,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 2037 transitions, 8376 flow. Second operand 15 states and 1785 transitions. [2024-02-10 00:55:21,729 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2024-02-10 00:55:21,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:55:22,527 INFO L124 PetriNetUnfolderBase]: 1976/3408 cut-off events. [2024-02-10 00:55:22,527 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2024-02-10 00:55:22,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 3408 events. 1976/3408 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 16055 event pairs, 1821 based on Foata normal form. 404/3462 useless extension candidates. Maximal degree in co-relation 4748. Up to 3250 conditions per place. [2024-02-10 00:55:22,608 INFO L140 encePairwiseOnDemand]: 98/119 looper letters, 16 selfloop transitions, 29 changer transitions 2/201 dead transitions. [2024-02-10 00:55:22,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 201 transitions, 906 flow [2024-02-10 00:55:22,611 INFO L231 Difference]: Finished difference. Result has 145 places, 198 transitions, 912 flow [2024-02-10 00:55:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-10 00:55:22,612 INFO L428 stractBuchiCegarLoop]: Abstraction has has 145 places, 198 transitions, 912 flow [2024-02-10 00:55:22,612 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:55:22,613 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 145 places, 198 transitions, 912 flow [2024-02-10 00:55:22,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:22,868 INFO L124 PetriNetUnfolderBase]: 445/857 cut-off events. [2024-02-10 00:55:22,868 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-10 00:55:22,869 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:22,872 INFO L748 eck$LassoCheckResult]: Stem: 119#[$Ultimate##0]true [278] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 121#[L-1]true [286] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 123#[L21]true [343] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 125#[L21-1]true [358] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 127#[L21-2]true [295] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 129#[L21-3]true [333] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 20) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 131#[L21-4]true [311] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 133#[L42]true [301] L42-->L42-1: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 135#[L42-1]true [359] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 137#[L42-2]true [309] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 139#[L42-3]true [274] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 141#[L-1-1]true [367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 143#[L-1-2]true [369] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 145#[L72]true [314] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 147#[L72-1]true [318] L72-1-->L72-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 149#[L72-2]true [265] L72-2-->L75: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 151#[L75]true [305] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 153#[L75-1]true [277] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[~n~0] 155#[L75-2]true [357] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 157#[L76]true [315] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 159#[L76-1]true [356] L76-1-->L76-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] 161#[L76-2]true [362] L76-2-->L90: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 163#[L90]true [363] L90-->L91: 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] 165#[L91]true [275] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 167#[L91-1]true [281] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 169#[L37]true [302] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 171#[L38]true [313] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 173#[L37-1]true [303] L37-1-->L91-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 175#[L91-2]true [317] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 177#[L92]true [350] L92-->L92-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_4|) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 179#[L92-1]true [345] L92-1-->L37-2: 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] 181#[L37-2]true [271] L37-2-->L38-3: 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] 183#[L38-3]true [283] L38-3-->L37-3: 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[] 185#[L37-3]true [279] L37-3-->L92-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] 187#[L92-2]true [307] L92-2-->L94: 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] 189#[L94]true [360] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 191#[L94-1]true [328] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 193#[L94-2]true [346] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 195#[L95]true [336] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 197#[L95-6]true [323] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 200#[L96]true [351] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 202#[L96-1]true [319] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse0) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 204#[L96-2]true [273] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 206#[L95-3]true [354] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 208#[L95-4]true [293] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 210#[L95-5]true [260] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 197#[L95-6]true [324] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 529#[L95-7]true [269] L95-7-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 531#[L98]true [344] L98-->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] 533#[create_fresh_int_array_returnLabel#1]true [352] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) 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~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 535#[L76-3]true [266] L76-3-->L76-4: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 537#[L76-4]true [320] L76-4-->L76-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] 539#[L76-5]true [364] L76-5-->L76-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 541#[L76-6]true [261] L76-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 543#[L79]true [298] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 545#[L79-1]true [353] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 547#[L79-2]true [280] L79-2-->L79-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 549#[L79-3]true [398] L79-3-->L53: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 551#[L79-4, L53]true [375] L53-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 554#[L79-4, L48]true [378] L48-->L48-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 556#[L79-4, L48-3]true [381] L48-3-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 558#[L79-4, L49]true [383] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_48 4)) (.cse2 (* v_~size~0_52 4))) (let ((.cse3 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (= (select |v_#valid_39| v_~queue~0.base_23) 1) (not (= (ite (let ((.cse0 (+ v_~front~0_48 v_~size~0_52))) (and (<= 0 .cse0) (< .cse0 v_~n~0_22))) 1 0) 0)) (= (+ v_~size~0_52 1) v_~size~0_51) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (<= 0 .cse3) (not (= (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse3) 5) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_52, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_22, ~front~0=v_~front~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_51, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_22, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 551#[L79-4, L53]true [2024-02-10 00:55:22,873 INFO L750 eck$LassoCheckResult]: Loop: 551#[L79-4, L53]true [375] L53-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 554#[L79-4, L48]true [378] L48-->L48-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 556#[L79-4, L48-3]true [381] L48-3-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 558#[L79-4, L49]true [383] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_48 4)) (.cse2 (* v_~size~0_52 4))) (let ((.cse3 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (= (select |v_#valid_39| v_~queue~0.base_23) 1) (not (= (ite (let ((.cse0 (+ v_~front~0_48 v_~size~0_52))) (and (<= 0 .cse0) (< .cse0 v_~n~0_22))) 1 0) 0)) (= (+ v_~size~0_52 1) v_~size~0_51) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (<= 0 .cse3) (not (= (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse3) 5) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_52, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_22, ~front~0=v_~front~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_51, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_22, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 551#[L79-4, L53]true [2024-02-10 00:55:22,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash 222890421, now seen corresponding path program 1 times [2024-02-10 00:55:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817122079] [2024-02-10 00:55:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:22,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:22,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:23,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:23,000 INFO L85 PathProgramCache]: Analyzing trace with hash 12470598, now seen corresponding path program 2 times [2024-02-10 00:55:23,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:23,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746535592] [2024-02-10 00:55:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:23,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:23,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:23,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash -901555974, now seen corresponding path program 2 times [2024-02-10 00:55:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726555501] [2024-02-10 00:55:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:23,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:55:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:55:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:55:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726555501] [2024-02-10 00:55:23,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726555501] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-10 00:55:23,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436733636] [2024-02-10 00:55:23,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-10 00:55:23,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-10 00:55:23,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:23,382 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-10 00:55:23,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-02-10 00:55:23,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-10 00:55:23,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-10 00:55:23,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-10 00:55:23,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:55:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:55:24,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-10 00:55:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:55:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436733636] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-10 00:55:24,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-10 00:55:24,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-02-10 00:55:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71702134] [2024-02-10 00:55:24,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-10 00:55:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:55:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-02-10 00:55:24,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2024-02-10 00:55:57,129 INFO L175 Difference]: Start difference. First operand has 145 places, 198 transitions, 912 flow. Second operand 385 states and 45815 transitions. [2024-02-10 00:55:57,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 198 transitions, 912 flow. Second operand 385 states and 45815 transitions. [2024-02-10 00:55:57,196 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 119 [2024-02-10 00:55:57,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:55:58,414 INFO L124 PetriNetUnfolderBase]: 3390/5811 cut-off events. [2024-02-10 00:55:58,414 INFO L125 PetriNetUnfolderBase]: For 1789/1789 co-relation queries the response was YES. [2024-02-10 00:55:58,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12822 conditions, 5811 events. 3390/5811 cut-off events. For 1789/1789 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 31028 event pairs, 3194 based on Foata normal form. 70/5309 useless extension candidates. Maximal degree in co-relation 10239. Up to 5634 conditions per place. [2024-02-10 00:55:58,511 INFO L140 encePairwiseOnDemand]: 102/119 looper letters, 24 selfloop transitions, 47 changer transitions 0/220 dead transitions. [2024-02-10 00:55:58,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 220 transitions, 1168 flow [2024-02-10 00:55:58,514 INFO L231 Difference]: Finished difference. Result has 536 places, 215 transitions, 1150 flow [2024-02-10 00:55:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 385 states. [2024-02-10 00:55:58,516 INFO L428 stractBuchiCegarLoop]: Abstraction has has 536 places, 215 transitions, 1150 flow [2024-02-10 00:55:58,516 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:55:58,516 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 536 places, 215 transitions, 1150 flow [2024-02-10 00:55:58,989 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:58,990 INFO L124 PetriNetUnfolderBase]: 1060/1926 cut-off events. [2024-02-10 00:55:58,990 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2024-02-10 00:55:58,990 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:58,992 INFO L748 eck$LassoCheckResult]: Stem: 119#[$Ultimate##0]true [278] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 121#[L-1]true [286] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 123#[L21]true [343] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 125#[L21-1]true [358] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 127#[L21-2]true [295] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 129#[L21-3]true [333] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 20) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 131#[L21-4]true [311] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 133#[L42]true [301] L42-->L42-1: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 135#[L42-1]true [359] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 137#[L42-2]true [309] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 139#[L42-3]true [274] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 141#[L-1-1]true [367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 143#[L-1-2]true [369] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 145#[L72]true [314] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 147#[L72-1]true [318] L72-1-->L72-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 149#[L72-2]true [265] L72-2-->L75: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 151#[L75]true [305] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 153#[L75-1]true [277] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[~n~0] 155#[L75-2]true [357] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 157#[L76]true [315] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 159#[L76-1]true [356] L76-1-->L76-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] 161#[L76-2]true [362] L76-2-->L90: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 163#[L90]true [363] L90-->L91: 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] 165#[L91]true [275] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 167#[L91-1]true [281] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 169#[L37]true [302] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 171#[L38]true [313] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 173#[L37-1]true [303] L37-1-->L91-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 175#[L91-2]true [317] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 177#[L92]true [350] L92-->L92-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_4|) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 179#[L92-1]true [345] L92-1-->L37-2: 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] 181#[L37-2]true [271] L37-2-->L38-3: 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] 183#[L38-3]true [283] L38-3-->L37-3: 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[] 185#[L37-3]true [279] L37-3-->L92-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] 187#[L92-2]true [307] L92-2-->L94: 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] 189#[L94]true [360] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 191#[L94-1]true [328] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 193#[L94-2]true [346] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 195#[L95]true [336] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 197#[L95-6]true [323] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 200#[L96]true [351] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 202#[L96-1]true [319] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse0) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 204#[L96-2]true [273] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 206#[L95-3]true [354] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 208#[L95-4]true [293] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 210#[L95-5]true [260] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 197#[L95-6]true [323] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 200#[L96]true [351] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 202#[L96-1]true [319] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse0) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 204#[L96-2]true [273] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 206#[L95-3]true [354] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 208#[L95-4]true [293] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 210#[L95-5]true [260] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 197#[L95-6]true [324] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 529#[L95-7]true [269] L95-7-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 531#[L98]true [344] L98-->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] 533#[create_fresh_int_array_returnLabel#1]true [352] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) 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~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 535#[L76-3]true [266] L76-3-->L76-4: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 537#[L76-4]true [320] L76-4-->L76-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] 539#[L76-5]true [364] L76-5-->L76-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 541#[L76-6]true [261] L76-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 543#[L79]true [298] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 545#[L79-1]true [353] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 547#[L79-2]true [280] L79-2-->L79-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 549#[L79-3]true [398] L79-3-->L53: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 551#[L79-4, L53]true [375] L53-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 554#[L79-4, L48]true [378] L48-->L48-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 556#[L79-4, L48-3]true [381] L48-3-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 558#[L79-4, L49]true [383] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_48 4)) (.cse2 (* v_~size~0_52 4))) (let ((.cse3 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (= (select |v_#valid_39| v_~queue~0.base_23) 1) (not (= (ite (let ((.cse0 (+ v_~front~0_48 v_~size~0_52))) (and (<= 0 .cse0) (< .cse0 v_~n~0_22))) 1 0) 0)) (= (+ v_~size~0_52 1) v_~size~0_51) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (<= 0 .cse3) (not (= (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse3) 5) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_52, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_22, ~front~0=v_~front~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_51, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_22, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 551#[L79-4, L53]true [2024-02-10 00:55:58,992 INFO L750 eck$LassoCheckResult]: Loop: 551#[L79-4, L53]true [375] L53-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 554#[L79-4, L48]true [378] L48-->L48-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 556#[L79-4, L48-3]true [381] L48-3-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 558#[L79-4, L49]true [383] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_48 4)) (.cse2 (* v_~size~0_52 4))) (let ((.cse3 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (= (select |v_#valid_39| v_~queue~0.base_23) 1) (not (= (ite (let ((.cse0 (+ v_~front~0_48 v_~size~0_52))) (and (<= 0 .cse0) (< .cse0 v_~n~0_22))) 1 0) 0)) (= (+ v_~size~0_52 1) v_~size~0_51) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (<= 0 .cse3) (not (= (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse3) 5) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_52, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_22, ~front~0=v_~front~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_51, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_22, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 551#[L79-4, L53]true [2024-02-10 00:55:58,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash -726855550, now seen corresponding path program 3 times [2024-02-10 00:55:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643610641] [2024-02-10 00:55:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:59,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:59,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:59,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 12470598, now seen corresponding path program 3 times [2024-02-10 00:55:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918937690] [2024-02-10 00:55:59,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:59,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:59,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:59,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1619185337, now seen corresponding path program 4 times [2024-02-10 00:55:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:59,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595024563] [2024-02-10 00:55:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:59,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:59,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:56:00,890 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:56:00,890 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:56:00,890 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:56:00,890 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:56:00,890 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:56:00,890 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:00,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:56:00,891 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:56:00,891 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_BEv2_Iteration4_Lasso [2024-02-10 00:56:00,891 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:56:00,891 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:56:00,894 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:56:00,896 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:56:00,898 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:56:01,719 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:56:01,722 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:56:01,724 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:56:01,726 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:56:01,728 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:56:01,729 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:56:01,731 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:56:01,733 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:56:01,735 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:56:01,737 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:56:01,739 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:56:01,741 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:56:01,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:56:01,745 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:56:01,747 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:56:01,748 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:56:01,750 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:56:01,768 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:56:01,770 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:56:01,773 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:56:01,775 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:56:01,777 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:56:01,778 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:56:01,780 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:56:01,782 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:56:01,784 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:56:01,786 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:56:01,788 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:56:01,789 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:56:01,791 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:56:01,793 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:56:01,797 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:56:01,799 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:56:02,301 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:56:02,302 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:56:02,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,308 INFO L229 MonitoredProcess]: Starting monitored process 24 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:56:02,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-02-10 00:56:02,335 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:56:02,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:56:02,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:56:02,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:56:02,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,366 INFO L229 MonitoredProcess]: Starting monitored process 25 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:56:02,369 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:56:02,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:56:02,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:56:02,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:56:02,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-02-10 00:56:02,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,393 INFO L229 MonitoredProcess]: Starting monitored process 26 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:56:02,397 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:56:02,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-02-10 00:56:02,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,468 INFO L229 MonitoredProcess]: Starting monitored process 27 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:56:02,492 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:56:02,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-02-10 00:56:02,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,571 INFO L229 MonitoredProcess]: Starting monitored process 28 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:56:02,575 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:56:02,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-02-10 00:56:02,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,608 INFO L229 MonitoredProcess]: Starting monitored process 29 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:56:02,615 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:56:02,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-02-10 00:56:02,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,648 INFO L229 MonitoredProcess]: Starting monitored process 30 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:56:02,652 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:56:02,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-02-10 00:56:02,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,705 INFO L229 MonitoredProcess]: Starting monitored process 31 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:56:02,709 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:56:02,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-02-10 00:56:02,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,733 INFO L229 MonitoredProcess]: Starting monitored process 32 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:56:02,738 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:56:02,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-02-10 00:56:02,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,771 INFO L229 MonitoredProcess]: Starting monitored process 33 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:56:02,774 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:56:02,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-02-10 00:56:02,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,804 INFO L229 MonitoredProcess]: Starting monitored process 34 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:56:02,807 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:56:02,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:02,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:02,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:02,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-02-10 00:56:02,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:02,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:02,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:02,850 INFO L229 MonitoredProcess]: Starting monitored process 35 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:56:02,853 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:56:02,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:02,862 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 00:56:02,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:02,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:02,867 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-02-10 00:56:02,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:03,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:03,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-02-10 00:56:03,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:03,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:03,024 INFO L229 MonitoredProcess]: Starting monitored process 36 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:56:03,027 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:56:03,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:03,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:03,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:03,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:03,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:03,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:03,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-02-10 00:56:03,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:03,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:03,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:03,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:03,047 INFO L229 MonitoredProcess]: Starting monitored process 37 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:56:03,050 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:56:03,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:03,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:03,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:03,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:03,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:03,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:03,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-02-10 00:56:03,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:56:03,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:03,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:03,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:03,080 INFO L229 MonitoredProcess]: Starting monitored process 38 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:56:03,083 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:56:03,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:03,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:03,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:03,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:03,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:03,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:03,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-02-10 00:56:03,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:56:03,233 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-02-10 00:56:03,234 INFO L444 ModelExtractionUtils]: 0 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2024-02-10 00:56:03,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:03,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:03,236 INFO L229 MonitoredProcess]: Starting monitored process 39 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:56:03,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:56:03,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-02-10 00:56:03,261 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-02-10 00:56:03,261 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:56:03,261 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~size~0, v_rep(select #length ~queue~0.base)_1, ~queue~0.offset) = -4*~size~0 + 1*v_rep(select #length ~queue~0.base)_1 - 1*~queue~0.offset Supporting invariants [1*~front~0 >= 0] [2024-02-10 00:56:03,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:03,413 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2024-02-10 00:56:03,416 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~queue~0!base] could not be translated [2024-02-10 00:56:03,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:56:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:56:03,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-10 00:56:03,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:56:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:56:04,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:56:04,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:56:04,526 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:56:04,527 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2024-02-10 00:56:04,527 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:56:04,673 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 10 states and 1590 transitions.7 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:56:04,673 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:56:04,673 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:56:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states and 1590 transitions. [2024-02-10 00:56:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1590 transitions. [2024-02-10 00:56:04,716 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:56:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states and 1590 transitions. [2024-02-10 00:56:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1590 transitions. [2024-02-10 00:56:04,941 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:56:04,941 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:56:04,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2024-02-10 00:56:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:56:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 589 transitions. [2024-02-10 00:56:04,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 589 transitions. Stem has 69 letters. Loop has 4 letters. [2024-02-10 00:56:04,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:56:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 589 transitions. Stem has 73 letters. Loop has 4 letters. [2024-02-10 00:56:04,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:56:04,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 589 transitions. Stem has 69 letters. Loop has 8 letters. [2024-02-10 00:56:04,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:56:04,962 INFO L428 stractBuchiCegarLoop]: Abstraction has has 550 places, 3767 transitions, 27483 flow [2024-02-10 00:56:04,962 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-10 00:56:04,962 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 550 places, 3767 transitions, 27483 flow [2024-02-10 00:56:07,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:12,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:56:12,722 INFO L124 PetriNetUnfolderBase]: 6752/10036 cut-off events. [2024-02-10 00:56:12,722 INFO L125 PetriNetUnfolderBase]: For 691/691 co-relation queries the response was YES. [2024-02-10 00:56:12,722 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:56:12,752 INFO L748 eck$LassoCheckResult]: Stem: 119#[$Ultimate##0]true [278] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 121#[L-1]true [286] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 123#[L21]true [343] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 125#[L21-1]true [358] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 127#[L21-2]true [295] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 129#[L21-3]true [333] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 20) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 131#[L21-4]true [311] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 133#[L42]true [301] L42-->L42-1: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 135#[L42-1]true [359] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 137#[L42-2]true [309] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 139#[L42-3]true [274] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 141#[L-1-1]true [367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 143#[L-1-2]true [369] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 145#[L72]true [314] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 147#[L72-1]true [318] L72-1-->L72-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 149#[L72-2]true [265] L72-2-->L75: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 151#[L75]true [305] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 153#[L75-1]true [277] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[~n~0] 155#[L75-2]true [357] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 157#[L76]true [315] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 159#[L76-1]true [356] L76-1-->L76-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] 161#[L76-2]true [362] L76-2-->L90: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 163#[L90]true [363] L90-->L91: 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] 165#[L91]true [275] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 167#[L91-1]true [281] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 169#[L37]true [302] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 171#[L38]true [313] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 173#[L37-1]true [303] L37-1-->L91-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 175#[L91-2]true [317] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 177#[L92]true [350] L92-->L92-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_4|) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 179#[L92-1]true [345] L92-1-->L37-2: 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] 181#[L37-2]true [271] L37-2-->L38-3: 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] 183#[L38-3]true [283] L38-3-->L37-3: 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[] 185#[L37-3]true [279] L37-3-->L92-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] 187#[L92-2]true [307] L92-2-->L94: 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] 189#[L94]true [360] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 191#[L94-1]true [328] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 193#[L94-2]true [346] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 195#[L95]true [336] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 197#[L95-6]true [323] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 200#[L96]true [351] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 202#[L96-1]true [319] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse0) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 204#[L96-2]true [273] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 206#[L95-3]true [354] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 208#[L95-4]true [293] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 210#[L95-5]true [260] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 197#[L95-6]true [324] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 529#[L95-7]true [269] L95-7-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 531#[L98]true [344] L98-->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] 533#[create_fresh_int_array_returnLabel#1]true [352] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) 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~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 535#[L76-3]true [266] L76-3-->L76-4: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 537#[L76-4]true [320] L76-4-->L76-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] 539#[L76-5]true [364] L76-5-->L76-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 541#[L76-6]true [261] L76-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 543#[L79]true [298] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 545#[L79-1]true [353] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 547#[L79-2]true [280] L79-2-->L79-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 549#[L79-3]true [398] L79-3-->L53: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 551#[L79-4, L53]true [375] L53-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 554#[L79-4, L48]true [378] L48-->L48-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 556#[L79-4, L48-3]true [381] L48-3-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 558#[L79-4, L49]true [304] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 2686#[L49, L79-5]true [270] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 2688#[L49, L80]true [267] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 2690#[L80-1, L49]true [355] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 2692#[L80-2, L49]true [272] L80-2-->L80-3: Formula: (and (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre12#1_3|)) |v_#memory_int_9|)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 2694#[L80-3, L49]true [395] L80-3-->L66: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_12|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1] 2696#[L66, L80-4, L49]true [384] L66-->L59: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 2698#[L59, L80-4, L49]true [383] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_48 4)) (.cse2 (* v_~size~0_52 4))) (let ((.cse3 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (= (select |v_#valid_39| v_~queue~0.base_23) 1) (not (= (ite (let ((.cse0 (+ v_~front~0_48 v_~size~0_52))) (and (<= 0 .cse0) (< .cse0 v_~n~0_22))) 1 0) 0)) (= (+ v_~size~0_52 1) v_~size~0_51) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (<= 0 .cse3) (not (= (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse3) 5) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_52, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_22, ~front~0=v_~front~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_51, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_22, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 2700#[L59, L80-4, L53]true [387] L59-->L59-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[] 2702#[L80-4, L59-3, L53]true [390] L59-3-->L60: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 2704#[L80-4, L53, L60]true [392] L60-->L66: Formula: (let ((.cse1 (* v_~front~0_61 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_29))) (and (not (= (ite (< 0 v_~size~0_64) 1 0) 0)) (= v_~x~0_15 (select (select |v_#memory_int_37| v_~queue~0.base_29) .cse0)) (not (= (ite (and (<= 0 v_~front~0_61) (< v_~front~0_61 v_~n~0_30)) 1 0) 0)) (= (+ v_~size~0_63 1) v_~size~0_64) (<= (+ .cse1 4 v_~queue~0.offset_29) (select |v_#length_40| v_~queue~0.base_29)) (<= 0 .cse0) (= v_~front~0_60 (+ v_~front~0_61 1)) (= (select |v_#valid_45| v_~queue~0.base_29) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_64, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, #length=|v_#length_40|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_30, ~front~0=v_~front~0_61} OutVars{~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_63, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_40|, ~n~0=v_~n~0_30, ~x~0=v_~x~0_15, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|, ~front~0=v_~front~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~size~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~x~0, thread2Thread1of1ForFork0_#t~post6#1, ~front~0] 2706#[L66, L80-4, L53]true [2024-02-10 00:56:12,752 INFO L750 eck$LassoCheckResult]: Loop: 2706#[L66, L80-4, L53]true [384] L66-->L59: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 2700#[L59, L80-4, L53]true [387] L59-->L59-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[] 2702#[L80-4, L59-3, L53]true [390] L59-3-->L60: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 2704#[L80-4, L53, L60]true [392] L60-->L66: Formula: (let ((.cse1 (* v_~front~0_61 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_29))) (and (not (= (ite (< 0 v_~size~0_64) 1 0) 0)) (= v_~x~0_15 (select (select |v_#memory_int_37| v_~queue~0.base_29) .cse0)) (not (= (ite (and (<= 0 v_~front~0_61) (< v_~front~0_61 v_~n~0_30)) 1 0) 0)) (= (+ v_~size~0_63 1) v_~size~0_64) (<= (+ .cse1 4 v_~queue~0.offset_29) (select |v_#length_40| v_~queue~0.base_29)) (<= 0 .cse0) (= v_~front~0_60 (+ v_~front~0_61 1)) (= (select |v_#valid_45| v_~queue~0.base_29) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_64, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, #length=|v_#length_40|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_30, ~front~0=v_~front~0_61} OutVars{~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_63, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_40|, ~n~0=v_~n~0_30, ~x~0=v_~x~0_15, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|, ~front~0=v_~front~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~size~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~x~0, thread2Thread1of1ForFork0_#t~post6#1, ~front~0] 2706#[L66, L80-4, L53]true [2024-02-10 00:56:12,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:56:12,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1711782763, now seen corresponding path program 1 times [2024-02-10 00:56:12,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:56:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177094575] [2024-02-10 00:56:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:56:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:56:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:12,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:56:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:12,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:56:12,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:56:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash 12747654, now seen corresponding path program 1 times [2024-02-10 00:56:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:56:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927813406] [2024-02-10 00:56:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:56:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:56:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:12,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:56:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:12,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:56:12,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:56:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1548384752, now seen corresponding path program 2 times [2024-02-10 00:56:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:56:12,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085853617] [2024-02-10 00:56:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:56:12,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:56:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:56:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-10 00:56:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:56:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085853617] [2024-02-10 00:56:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085853617] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-10 00:56:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078068937] [2024-02-10 00:56:13,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-10 00:56:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-10 00:56:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:13,018 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-10 00:56:13,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-02-10 00:56:13,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-10 00:56:13,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-10 00:56:13,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:56:13,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:56:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-10 00:56:13,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-10 00:56:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078068937] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:56:13,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-10 00:56:13,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-02-10 00:56:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263676792] [2024-02-10 00:56:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:56:13,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:56:13,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:56:13,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-10 00:56:13,323 INFO L175 Difference]: Start difference. First operand has 550 places, 3767 transitions, 27483 flow. Second operand 4 states and 476 transitions. [2024-02-10 00:56:13,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 3767 transitions, 27483 flow. Second operand 4 states and 476 transitions. [2024-02-10 00:56:13,324 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 119 [2024-02-10 00:56:13,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:56:19,935 INFO L124 PetriNetUnfolderBase]: 17341/26227 cut-off events. [2024-02-10 00:56:19,935 INFO L125 PetriNetUnfolderBase]: For 7282/7282 co-relation queries the response was YES. [2024-02-10 00:56:20,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82541 conditions, 26227 events. 17341/26227 cut-off events. For 7282/7282 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 147216 event pairs, 1909 based on Foata normal form. 139/19155 useless extension candidates. Maximal degree in co-relation 56187. Up to 25644 conditions per place. [2024-02-10 00:56:20,217 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 7 selfloop transitions, 23 changer transitions 57/980 dead transitions. [2024-02-10 00:56:20,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 980 transitions, 6971 flow [2024-02-10 00:56:20,228 INFO L231 Difference]: Finished difference. Result has 555 places, 923 transitions, 6597 flow [2024-02-10 00:56:20,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-10 00:56:20,231 INFO L428 stractBuchiCegarLoop]: Abstraction has has 555 places, 923 transitions, 6597 flow [2024-02-10 00:56:20,231 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-02-10 00:56:20,231 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 555 places, 923 transitions, 6597 flow [2024-02-10 00:56:37,705 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:56:37,705 INFO L124 PetriNetUnfolderBase]: 14455/21399 cut-off events. [2024-02-10 00:56:37,705 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2024-02-10 00:56:37,706 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:56:37,721 INFO L748 eck$LassoCheckResult]: Stem: 119#[$Ultimate##0]true [278] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 121#[L-1]true [286] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 123#[L21]true [343] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 125#[L21-1]true [358] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 127#[L21-2]true [295] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 129#[L21-3]true [333] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 20) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 131#[L21-4]true [311] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 133#[L42]true [301] L42-->L42-1: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 135#[L42-1]true [359] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 137#[L42-2]true [309] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 139#[L42-3]true [274] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 141#[L-1-1]true [367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 143#[L-1-2]true [369] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 145#[L72]true [314] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 147#[L72-1]true [318] L72-1-->L72-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 149#[L72-2]true [265] L72-2-->L75: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 151#[L75]true [305] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 153#[L75-1]true [277] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[~n~0] 155#[L75-2]true [357] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 157#[L76]true [315] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 159#[L76-1]true [356] L76-1-->L76-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] 161#[L76-2]true [362] L76-2-->L90: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 163#[L90]true [363] L90-->L91: 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] 165#[L91]true [275] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 167#[L91-1]true [281] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 169#[L37]true [302] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 171#[L38]true [313] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 173#[L37-1]true [303] L37-1-->L91-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 175#[L91-2]true [317] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 177#[L92]true [350] L92-->L92-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_4|) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 179#[L92-1]true [345] L92-1-->L37-2: 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] 181#[L37-2]true [271] L37-2-->L38-3: 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] 183#[L38-3]true [283] L38-3-->L37-3: 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[] 185#[L37-3]true [279] L37-3-->L92-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] 187#[L92-2]true [307] L92-2-->L94: 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] 189#[L94]true [360] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 191#[L94-1]true [328] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 193#[L94-2]true [346] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 195#[L95]true [336] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 197#[L95-6]true [323] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 200#[L96]true [351] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 202#[L96-1]true [319] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse0) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 204#[L96-2]true [273] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 206#[L95-3]true [354] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 208#[L95-4]true [293] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 210#[L95-5]true [260] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 197#[L95-6]true [323] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 200#[L96]true [351] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 202#[L96-1]true [319] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse0) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 204#[L96-2]true [273] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 206#[L95-3]true [354] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 208#[L95-4]true [293] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 210#[L95-5]true [260] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 197#[L95-6]true [324] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#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~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 529#[L95-7]true [269] L95-7-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 531#[L98]true [344] L98-->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] 533#[create_fresh_int_array_returnLabel#1]true [352] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) 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~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 535#[L76-3]true [266] L76-3-->L76-4: Formula: true InVars {} OutVars{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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 537#[L76-4]true [320] L76-4-->L76-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] 539#[L76-5]true [364] L76-5-->L76-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 541#[L76-6]true [261] L76-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 543#[L79]true [298] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 545#[L79-1]true [353] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 547#[L79-2]true [280] L79-2-->L79-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 549#[L79-3]true [398] L79-3-->L53: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 551#[L79-4, L53]true [375] L53-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 554#[L79-4, L48]true [378] L48-->L48-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 556#[L79-4, L48-3]true [381] L48-3-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 558#[L79-4, L49]true [304] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 2686#[L49, L79-5]true [383] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_48 4)) (.cse2 (* v_~size~0_52 4))) (let ((.cse3 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (= (select |v_#valid_39| v_~queue~0.base_23) 1) (not (= (ite (let ((.cse0 (+ v_~front~0_48 v_~size~0_52))) (and (<= 0 .cse0) (< .cse0 v_~n~0_22))) 1 0) 0)) (= (+ v_~size~0_52 1) v_~size~0_51) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (<= 0 .cse3) (not (= (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse3) 5) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_52, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_22, ~front~0=v_~front~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_51, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_22, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 3020#[L53, L79-5]true [270] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 3022#[L53, L80]true [267] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 3024#[L53, L80-1]true [355] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 3026#[L80-2, L53]true [272] L80-2-->L80-3: Formula: (and (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre12#1_3|)) |v_#memory_int_9|)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 3028#[L80-3, L53]true [395] L80-3-->L66: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_12|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1] 2706#[L66, L80-4, L53]true [384] L66-->L59: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 2700#[L59, L80-4, L53]true [387] L59-->L59-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[] 2702#[L80-4, L59-3, L53]true [390] L59-3-->L60: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 2704#[L80-4, L53, L60]true [392] L60-->L66: Formula: (let ((.cse1 (* v_~front~0_61 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_29))) (and (not (= (ite (< 0 v_~size~0_64) 1 0) 0)) (= v_~x~0_15 (select (select |v_#memory_int_37| v_~queue~0.base_29) .cse0)) (not (= (ite (and (<= 0 v_~front~0_61) (< v_~front~0_61 v_~n~0_30)) 1 0) 0)) (= (+ v_~size~0_63 1) v_~size~0_64) (<= (+ .cse1 4 v_~queue~0.offset_29) (select |v_#length_40| v_~queue~0.base_29)) (<= 0 .cse0) (= v_~front~0_60 (+ v_~front~0_61 1)) (= (select |v_#valid_45| v_~queue~0.base_29) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_64, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, #length=|v_#length_40|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_30, ~front~0=v_~front~0_61} OutVars{~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_63, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_40|, ~n~0=v_~n~0_30, ~x~0=v_~x~0_15, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|, ~front~0=v_~front~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~size~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~x~0, thread2Thread1of1ForFork0_#t~post6#1, ~front~0] 2706#[L66, L80-4, L53]true [2024-02-10 00:56:37,721 INFO L750 eck$LassoCheckResult]: Loop: 2706#[L66, L80-4, L53]true [375] L53-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 3036#[L66, L80-4, L48]true [384] L66-->L59: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 3038#[L59, L80-4, L48]true [387] L59-->L59-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[] 3040#[L80-4, L48, L59-3]true [390] L59-3-->L60: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 3042#[L80-4, L48, L60]true [378] L48-->L48-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 3044#[L80-4, L48-3, L60]true [381] L48-3-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 3046#[L80-4, L49, L60]true [383] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_48 4)) (.cse2 (* v_~size~0_52 4))) (let ((.cse3 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (= (select |v_#valid_39| v_~queue~0.base_23) 1) (not (= (ite (let ((.cse0 (+ v_~front~0_48 v_~size~0_52))) (and (<= 0 .cse0) (< .cse0 v_~n~0_22))) 1 0) 0)) (= (+ v_~size~0_52 1) v_~size~0_51) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (<= 0 .cse3) (not (= (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse3) 5) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_52, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_22, ~front~0=v_~front~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_51, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_22, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 2704#[L80-4, L53, L60]true [392] L60-->L66: Formula: (let ((.cse1 (* v_~front~0_61 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_29))) (and (not (= (ite (< 0 v_~size~0_64) 1 0) 0)) (= v_~x~0_15 (select (select |v_#memory_int_37| v_~queue~0.base_29) .cse0)) (not (= (ite (and (<= 0 v_~front~0_61) (< v_~front~0_61 v_~n~0_30)) 1 0) 0)) (= (+ v_~size~0_63 1) v_~size~0_64) (<= (+ .cse1 4 v_~queue~0.offset_29) (select |v_#length_40| v_~queue~0.base_29)) (<= 0 .cse0) (= v_~front~0_60 (+ v_~front~0_61 1)) (= (select |v_#valid_45| v_~queue~0.base_29) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_64, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, #length=|v_#length_40|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_30, ~front~0=v_~front~0_61} OutVars{~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_63, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_40|, ~n~0=v_~n~0_30, ~x~0=v_~x~0_15, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|, ~front~0=v_~front~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~size~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~x~0, thread2Thread1of1ForFork0_#t~post6#1, ~front~0] 2706#[L66, L80-4, L53]true [2024-02-10 00:56:37,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:56:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 149736858, now seen corresponding path program 3 times [2024-02-10 00:56:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:56:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200488969] [2024-02-10 00:56:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:56:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:56:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:37,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:56:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:37,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:56:37,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:56:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1023218567, now seen corresponding path program 1 times [2024-02-10 00:56:37,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:56:37,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623115304] [2024-02-10 00:56:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:56:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:56:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:37,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:56:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:37,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:56:37,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:56:37,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1984360174, now seen corresponding path program 4 times [2024-02-10 00:56:37,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:56:37,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127497233] [2024-02-10 00:56:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:56:37,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:56:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:37,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:56:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:56:37,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:56:40,610 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:56:40,610 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:56:40,610 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:56:40,610 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:56:40,610 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:56:40,610 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:40,610 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:56:40,611 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:56:40,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_BEv2_Iteration6_Lasso [2024-02-10 00:56:40,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:56:40,611 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:56:40,614 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:56:41,675 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:56:41,677 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:56:41,680 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:56:41,681 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:56:41,683 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:56:41,685 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:56:41,687 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:56:41,688 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:56:41,690 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:56:41,692 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:56:41,694 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:56:41,696 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:56:41,697 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:56:41,699 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:56:41,701 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:56:41,703 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:56:41,706 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:56:41,708 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:56:41,709 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:56:41,711 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:56:41,713 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:56:41,714 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:56:41,716 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:56:41,721 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:56:41,723 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:56:41,726 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:56:41,728 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:56:41,731 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:56:41,733 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:56:41,735 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:56:41,737 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:56:41,740 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:56:41,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:56:41,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:56:41,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:56:41,748 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:56:41,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:56:41,755 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:56:41,758 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:56:41,760 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:56:41,761 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:56:41,763 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:56:41,765 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:56:41,768 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:56:42,349 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:56:42,349 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:56:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:42,354 INFO L229 MonitoredProcess]: Starting monitored process 41 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:56:42,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-02-10 00:56:42,387 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:56:42,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:56:42,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:56:42,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:56:42,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:56:42,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:56:42,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:56:42,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:56:42,612 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-02-10 00:56:42,613 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2024-02-10 00:56:42,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:56:42,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:56:42,616 INFO L229 MonitoredProcess]: Starting monitored process 42 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:56:42,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:56:42,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-02-10 00:56:42,668 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:56:42,668 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:56:42,668 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~front~0, v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_2) = -4*~front~0 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_2 Supporting invariants [] [2024-02-10 00:56:42,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:42,773 INFO L156 tatePredicateManager]: 32 out of 34 supporting invariants were superfluous and have been removed [2024-02-10 00:56:42,777 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[#res!base] could not be translated [2024-02-10 00:56:42,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:56:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:56:42,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjunts are in the unsatisfiable core [2024-02-10 00:56:42,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:56:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:56:43,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-10 00:56:43,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:56:43,370 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:56:43,371 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-02-10 00:56:43,372 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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:56:44,645 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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 48 states and 8049 transitions.26 powerset states22 rank states. The highest rank that occured is 1 [2024-02-10 00:56:44,645 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:56:44,645 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:56:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states and 8049 transitions. [2024-02-10 00:56:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 8049 transitions. [2024-02-10 00:56:44,695 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:56:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states and 8049 transitions. [2024-02-10 00:56:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 8049 transitions. [2024-02-10 00:56:44,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-02-10 00:56:50,856 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:56:50,857 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:56:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 20 stem states 2 non-accepting loop states 2 accepting loop states [2024-02-10 00:56:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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:56:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2839 transitions. [2024-02-10 00:56:50,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 2839 transitions. Stem has 79 letters. Loop has 8 letters. [2024-02-10 00:56:50,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:56:50,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 2839 transitions. Stem has 87 letters. Loop has 8 letters. [2024-02-10 00:56:50,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:56:50,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 2839 transitions. Stem has 79 letters. Loop has 16 letters. [2024-02-10 00:56:50,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:56:50,864 INFO L428 stractBuchiCegarLoop]: Abstraction has has 626 places, 85616 transitions, 777826 flow [2024-02-10 00:56:50,864 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-02-10 00:56:50,864 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 626 places, 85616 transitions, 777826 flow Received shutdown request... [2024-02-10 00:59:48,754 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 00:59:48,754 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 00:59:48,754 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 00:59:48,877 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 00:59:48,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:59:48 BoogieIcfgContainer [2024-02-10 00:59:48,917 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:59:48,917 INFO L158 Benchmark]: Toolchain (without parser) took 277429.41ms. Allocated memory was 180.4MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 109.1MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2024-02-10 00:59:48,917 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory was 142.3MB in the beginning and 142.3MB in the end (delta: 55.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:59:48,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.59ms. Allocated memory was 180.4MB in the beginning and 254.8MB in the end (delta: 74.4MB). Free memory was 109.0MB in the beginning and 222.6MB in the end (delta: -113.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2024-02-10 00:59:48,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.84ms. Allocated memory is still 254.8MB. Free memory was 222.1MB in the beginning and 220.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:59:48,918 INFO L158 Benchmark]: Boogie Preprocessor took 56.47ms. Allocated memory is still 254.8MB. Free memory was 220.5MB in the beginning and 218.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:59:48,918 INFO L158 Benchmark]: RCFGBuilder took 1017.00ms. Allocated memory is still 254.8MB. Free memory was 218.9MB in the beginning and 191.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2024-02-10 00:59:48,918 INFO L158 Benchmark]: BuchiAutomizer took 275770.41ms. Allocated memory was 254.8MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 191.7MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2024-02-10 00:59:48,920 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory was 142.3MB in the beginning and 142.3MB in the end (delta: 55.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 453.59ms. Allocated memory was 180.4MB in the beginning and 254.8MB in the end (delta: 74.4MB). Free memory was 109.0MB in the beginning and 222.6MB in the end (delta: -113.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 110.84ms. Allocated memory is still 254.8MB. Free memory was 222.1MB in the beginning and 220.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.47ms. Allocated memory is still 254.8MB. Free memory was 220.5MB in the beginning and 218.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 1017.00ms. Allocated memory is still 254.8MB. Free memory was 218.9MB in the beginning and 191.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * BuchiAutomizer took 275770.41ms. Allocated memory was 254.8MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 191.7MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[~queue~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[#res!base] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function NULL and consists of 7 locations. One deterministic module has affine ranking function NULL and consists of 6 locations. One deterministic module has affine ranking function NULL and consists of 25 locations. 3 modules have a trivial ranking function, the largest among these consists of 28 locations. The remainder module has 777826 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 275.5s and 7 iterations. TraceHistogramMax:0. Analysis of lassos took 17.9s. Construction of modules took 7.2s. Büchi inclusion checks took 45.9s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9430 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9429 mSDsluCounter, 52860 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46208 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9383 IncrementalHoareTripleChecker+Invalid, 9694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 6652 mSDtfsCounter, 9383 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital309 mio100 ax111 hnf100 lsp84 ukn66 mio100 lsp36 div179 bol100 ite100 ukn100 eq150 hnf93 smp68 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 152ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown