/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-context1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:15:56,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:15:56,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:15:56,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:15:56,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:15:57,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:15:57,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:15:57,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:15:57,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:15:57,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:15:57,020 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:15:57,020 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:15:57,020 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:15:57,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:15:57,021 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:15:57,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:15:57,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:15:57,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:15:57,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:15:57,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:15:57,022 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:15:57,022 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:15:57,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:15:57,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:15:57,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:15:57,233 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:15:57,233 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:15:57,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-context1.wvr.c [2025-04-26 16:15:58,562 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ff7212768/6250d4f2022a4964b46f57628f99a534/FLAG04f7a0738 [2025-04-26 16:15:58,750 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:15:58,752 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c [2025-04-26 16:15:58,758 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ff7212768/6250d4f2022a4964b46f57628f99a534/FLAG04f7a0738 [2025-04-26 16:15:59,612 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ff7212768/6250d4f2022a4964b46f57628f99a534 [2025-04-26 16:15:59,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:15:59,615 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:15:59,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:15:59,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:15:59,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:15:59,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfba4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59, skipping insertion in model container [2025-04-26 16:15:59,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:15:59,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:15:59,779 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:15:59,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:15:59,821 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:15:59,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59 WrapperNode [2025-04-26 16:15:59,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:15:59,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:15:59,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:15:59,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:15:59,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,858 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 122 [2025-04-26 16:15:59,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:15:59,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:15:59,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:15:59,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:15:59,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:15:59,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:15:59,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:15:59,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:15:59,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (1/1) ... [2025-04-26 16:15:59,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:15:59,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:15:59,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:15:59,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:15:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:15:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:15:59,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:15:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:15:59,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:15:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:15:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 16:15:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-26 16:15:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-26 16:15:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 16:15:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:15:59,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:15:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 16:15:59,933 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:15:59,997 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:15:59,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:16:00,196 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:16:00,196 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:16:00,276 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:16:00,276 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:16:00,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:16:00 BoogieIcfgContainer [2025-04-26 16:16:00,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:16:00,281 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:16:00,281 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:16:00,286 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:16:00,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:16:00,286 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:15:59" (1/3) ... [2025-04-26 16:16:00,287 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31bbc4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:16:00, skipping insertion in model container [2025-04-26 16:16:00,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:16:00,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:15:59" (2/3) ... [2025-04-26 16:16:00,287 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31bbc4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:16:00, skipping insertion in model container [2025-04-26 16:16:00,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:16:00,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:16:00" (3/3) ... [2025-04-26 16:16:00,288 INFO L376 chiAutomizerObserver]: Analyzing ICFG test-context1.wvr.c [2025-04-26 16:16:00,330 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:16:00,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 114 transitions, 242 flow [2025-04-26 16:16:00,393 INFO L116 PetriNetUnfolderBase]: 8/110 cut-off events. [2025-04-26 16:16:00,395 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:16:00,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 110 events. 8/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2025-04-26 16:16:00,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 114 transitions, 242 flow [2025-04-26 16:16:00,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 110 transitions, 232 flow [2025-04-26 16:16:00,402 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 109 places, 110 transitions, 232 flow [2025-04-26 16:16:00,410 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:16:00,410 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:16:00,410 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:16:00,410 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:16:00,410 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:16:00,410 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:16:00,410 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:16:00,410 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:16:00,411 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:16:00,481 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 267 [2025-04-26 16:16:00,482 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:00,482 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:00,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:00,488 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:00,488 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:16:00,488 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 444 states, but on-demand construction may add more states [2025-04-26 16:16:00,498 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 267 [2025-04-26 16:16:00,498 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:00,498 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:00,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:00,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:00,504 INFO L752 eck$LassoCheckResult]: Stem: "[271] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[278] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[329] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[348] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 20) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[300] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[289] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0]" "[349] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[298] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0]" "[267] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0]" "[357] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[359] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_5|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_5|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, 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]" "[303] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[307] L72-1-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[313] L74-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0]" "[294] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[270] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[~n~0]" "[347] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[304] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2| 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_2|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[346] 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_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] L76-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[268] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_8|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[274] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[291] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[302] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[]" "[292] 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[340] L92-->L92-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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_#in~cond#1]" "[333] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[263] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1]" "[276] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[272] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[350] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length]" "[315] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} 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_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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]" "[334] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base]" "[323] L95-->L95-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" [2025-04-26 16:16:00,505 INFO L754 eck$LassoCheckResult]: Loop: "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" [2025-04-26 16:16:00,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash 198842788, now seen corresponding path program 1 times [2025-04-26 16:16:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:00,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590899382] [2025-04-26 16:16:00,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:00,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:00,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:16:00,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:16:00,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:00,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:00,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:00,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:16:00,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:16:00,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:00,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:00,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:00,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash 113277789, now seen corresponding path program 1 times [2025-04-26 16:16:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:00,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194010948] [2025-04-26 16:16:00,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:00,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:00,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:16:00,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:16:00,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:00,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:00,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:00,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:16:00,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:16:00,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:00,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:00,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:00,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash -211299238, now seen corresponding path program 1 times [2025-04-26 16:16:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:00,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712248660] [2025-04-26 16:16:00,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:00,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:00,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-26 16:16:00,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-26 16:16:00,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:00,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:00,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:00,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-26 16:16:00,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-26 16:16:00,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:00,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:00,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:01,083 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:16:01,084 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:16:01,084 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:16:01,084 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:16:01,084 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:16:01,084 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,084 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:16:01,084 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:16:01,085 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_petrified1_Iteration1_Lasso [2025-04-26 16:16:01,085 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:16:01,085 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:16:01,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:01,707 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:16:01,710 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:16:01,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:16:01,717 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 [2025-04-26 16:16:01,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:01,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:01,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:01,734 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:16:01,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:16:01,745 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 [2025-04-26 16:16:01,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:01,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:01,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:01,758 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:16:01,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:16:01,766 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 [2025-04-26 16:16:01,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:01,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:01,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:01,781 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:16:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:16:01,790 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 [2025-04-26 16:16:01,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:01,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:01,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:01,802 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:16:01,812 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 [2025-04-26 16:16:01,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:01,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:01,829 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:16:01,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:16:01,840 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 [2025-04-26 16:16:01,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:01,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:01,856 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:01,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:16:01,866 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 [2025-04-26 16:16:01,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:01,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:01,883 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,891 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:16:01,894 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 [2025-04-26 16:16:01,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:01,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:01,913 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,921 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:16:01,923 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 [2025-04-26 16:16:01,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:01,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:01,939 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:01,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,947 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:16:01,949 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 [2025-04-26 16:16:01,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:01,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:01,964 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:01,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,972 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:16:01,975 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 [2025-04-26 16:16:01,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:01,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:01,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:01,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:01,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:01,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:01,989 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:01,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:01,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:01,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:01,997 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:01,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:16:02,000 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 [2025-04-26 16:16:02,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:02,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:02,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:02,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:02,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:02,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:02,015 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:02,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:02,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:02,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:02,022 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:02,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:16:02,025 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 [2025-04-26 16:16:02,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:02,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:02,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:02,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:02,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:02,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:02,044 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:02,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:02,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:02,052 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:02,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:16:02,055 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 [2025-04-26 16:16:02,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:02,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:02,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:02,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:02,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:02,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:02,073 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:02,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:02,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:02,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:02,080 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:02,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:16:02,084 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 [2025-04-26 16:16:02,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:02,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:02,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:02,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:02,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:02,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:02,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:16:02,134 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:16:02,134 INFO L437 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:16:02,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:02,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:02,138 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:02,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:16:02,140 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:16:02,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:16:02,158 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:16:02,158 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:16:02,158 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [] [2025-04-26 16:16:02,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:02,178 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:16:02,184 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2025-04-26 16:16:02,185 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:16:02,185 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:16:02,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:02,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:16:02,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:16:02,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:02,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:02,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:16:02,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:02,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:16:02,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:16:02,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:02,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:02,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:16:02,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:02,371 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 [2025-04-26 16:16:02,373 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 444 states, but on-demand construction may add more states Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (in total 46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:02,489 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 444 states, but on-demand construction may add more states. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (in total 46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 873 states and 2157 transitions. Complement of second has 10 states. [2025-04-26 16:16:02,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:16:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (in total 46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-04-26 16:16:02,498 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 39 letters. Loop has 7 letters. [2025-04-26 16:16:02,499 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:02,499 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 46 letters. Loop has 7 letters. [2025-04-26 16:16:02,499 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:02,499 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 39 letters. Loop has 14 letters. [2025-04-26 16:16:02,499 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:02,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 873 states and 2157 transitions. [2025-04-26 16:16:02,509 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 260 [2025-04-26 16:16:02,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 873 states to 378 states and 908 transitions. [2025-04-26 16:16:02,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2025-04-26 16:16:02,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2025-04-26 16:16:02,517 INFO L74 IsDeterministic]: Start isDeterministic. Operand 378 states and 908 transitions. [2025-04-26 16:16:02,518 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:16:02,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 378 states and 908 transitions. [2025-04-26 16:16:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 908 transitions. [2025-04-26 16:16:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2025-04-26 16:16:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 377 states have (on average 2.405835543766578) internal successors, (in total 907), 376 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 907 transitions. [2025-04-26 16:16:02,556 INFO L240 hiAutomatonCegarLoop]: Abstraction has 377 states and 907 transitions. [2025-04-26 16:16:02,556 INFO L438 stractBuchiCegarLoop]: Abstraction has 377 states and 907 transitions. [2025-04-26 16:16:02,556 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:16:02,556 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 377 states and 907 transitions. [2025-04-26 16:16:02,559 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 260 [2025-04-26 16:16:02,559 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:02,559 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:02,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:02,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:16:02,562 INFO L752 eck$LassoCheckResult]: Stem: "[271] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[278] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[329] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[348] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 20) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[300] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[289] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0]" "[349] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[298] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0]" "[267] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0]" "[357] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[359] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_5|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_5|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, 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]" "[303] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[307] L72-1-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[313] L74-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0]" "[294] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[270] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[~n~0]" "[347] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[304] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2| 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_2|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[346] 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_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] L76-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[268] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_8|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[274] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[291] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[302] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[]" "[292] 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[340] L92-->L92-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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_#in~cond#1]" "[333] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[263] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1]" "[276] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[272] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[350] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length]" "[315] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} 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_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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]" "[334] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base]" "[323] L95-->L95-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[252] L95-5-->L95-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |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|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[]" "[312] L95-6-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[331] L98-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[342] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret9#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[258] L76-3-->L76-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_4|, 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_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[309] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[354] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[254] L76-6-->L79: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[286] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[343] 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]" "[273] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre10#1_2|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[389] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= 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_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, 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_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[362] $Ultimate##0-->L53: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" [2025-04-26 16:16:02,562 INFO L754 eck$LassoCheckResult]: Loop: "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:02,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1603918045, now seen corresponding path program 1 times [2025-04-26 16:16:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:02,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718356271] [2025-04-26 16:16:02,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:02,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-26 16:16:02,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-26 16:16:02,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:02,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:02,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:02,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-26 16:16:02,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-26 16:16:02,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:02,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:02,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:02,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash 376059791, now seen corresponding path program 1 times [2025-04-26 16:16:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:02,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926638487] [2025-04-26 16:16:02,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:02,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:02,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:02,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:02,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:02,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:02,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:02,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:02,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:02,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:02,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:02,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:02,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1932970579, now seen corresponding path program 1 times [2025-04-26 16:16:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:02,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350807636] [2025-04-26 16:16:02,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:02,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:16:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:16:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:02,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:16:02,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350807636] [2025-04-26 16:16:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350807636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:16:02,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:16:02,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:16:02,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693195309] [2025-04-26 16:16:02,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:16:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:16:02,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:16:02,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:16:02,978 INFO L87 Difference]: Start difference. First operand 377 states and 907 transitions. cyclomatic complexity: 571 Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (in total 57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:16:03,117 INFO L93 Difference]: Finished difference Result 1193 states and 2829 transitions. [2025-04-26 16:16:03,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1193 states and 2829 transitions. [2025-04-26 16:16:03,126 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 380 [2025-04-26 16:16:03,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1193 states to 762 states and 1841 transitions. [2025-04-26 16:16:03,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 750 [2025-04-26 16:16:03,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 750 [2025-04-26 16:16:03,137 INFO L74 IsDeterministic]: Start isDeterministic. Operand 762 states and 1841 transitions. [2025-04-26 16:16:03,139 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:16:03,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 762 states and 1841 transitions. [2025-04-26 16:16:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states and 1841 transitions. [2025-04-26 16:16:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 497. [2025-04-26 16:16:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 497 states have (on average 2.3360160965794767) internal successors, (in total 1161), 496 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1161 transitions. [2025-04-26 16:16:03,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 497 states and 1161 transitions. [2025-04-26 16:16:03,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-26 16:16:03,170 INFO L438 stractBuchiCegarLoop]: Abstraction has 497 states and 1161 transitions. [2025-04-26 16:16:03,170 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:16:03,170 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 497 states and 1161 transitions. [2025-04-26 16:16:03,173 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 245 [2025-04-26 16:16:03,173 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:03,173 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:03,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:03,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:16:03,177 INFO L752 eck$LassoCheckResult]: Stem: "[271] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[278] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[329] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[348] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 20) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[300] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[289] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0]" "[349] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[298] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0]" "[267] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0]" "[357] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[359] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_5|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_5|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, 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]" "[303] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[307] L72-1-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[313] L74-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0]" "[294] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[270] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[~n~0]" "[347] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[304] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2| 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_2|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[346] 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_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] L76-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[268] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_8|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[274] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[291] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[302] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[]" "[292] 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[340] L92-->L92-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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_#in~cond#1]" "[333] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[263] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1]" "[276] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[272] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[350] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length]" "[315] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} 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_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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]" "[334] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base]" "[323] L95-->L95-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[252] L95-5-->L95-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |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|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[]" "[312] L95-6-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[331] L98-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[342] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret9#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[258] L76-3-->L76-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_4|, 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_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[309] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[354] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[254] L76-6-->L79: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[286] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[343] 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]" "[273] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre10#1_2|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[389] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= 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_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, 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_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[362] $Ultimate##0-->L53: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:03,177 INFO L754 eck$LassoCheckResult]: Loop: "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:03,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1925320989, now seen corresponding path program 1 times [2025-04-26 16:16:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:03,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340500744] [2025-04-26 16:16:03,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:03,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:03,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-26 16:16:03,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-26 16:16:03,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:03,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:03,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:03,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-26 16:16:03,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-26 16:16:03,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:03,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:03,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:03,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash 376059791, now seen corresponding path program 2 times [2025-04-26 16:16:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:03,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159381876] [2025-04-26 16:16:03,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:16:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:03,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:03,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:03,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:16:03,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:03,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:03,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:03,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:03,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:03,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:03,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:03,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash -363313683, now seen corresponding path program 2 times [2025-04-26 16:16:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:03,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777777978] [2025-04-26 16:16:03,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:16:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:03,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-04-26 16:16:03,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 16:16:03,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:16:03,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:16:03,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777777978] [2025-04-26 16:16:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777777978] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:16:03,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046221002] [2025-04-26 16:16:03,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:16:03,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:16:03,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:03,533 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:16:03,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-26 16:16:03,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-04-26 16:16:03,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 16:16:03,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:16:03,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:03,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:16:03,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:03,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:16:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046221002] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:16:04,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:16:04,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-04-26 16:16:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139427895] [2025-04-26 16:16:04,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:16:04,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:16:04,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-26 16:16:04,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2025-04-26 16:16:04,300 INFO L87 Difference]: Start difference. First operand 497 states and 1161 transitions. cyclomatic complexity: 702 Second operand has 28 states, 27 states have (on average 7.037037037037037) internal successors, (in total 190), 28 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:16:04,649 INFO L93 Difference]: Finished difference Result 1479 states and 3574 transitions. [2025-04-26 16:16:04,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1479 states and 3574 transitions. [2025-04-26 16:16:04,661 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 520 [2025-04-26 16:16:04,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1479 states to 1287 states and 3086 transitions. [2025-04-26 16:16:04,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1268 [2025-04-26 16:16:04,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1268 [2025-04-26 16:16:04,679 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1287 states and 3086 transitions. [2025-04-26 16:16:04,680 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:16:04,680 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1287 states and 3086 transitions. [2025-04-26 16:16:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states and 3086 transitions. [2025-04-26 16:16:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 779. [2025-04-26 16:16:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 779 states have (on average 2.3388960205391527) internal successors, (in total 1822), 778 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1822 transitions. [2025-04-26 16:16:04,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 779 states and 1822 transitions. [2025-04-26 16:16:04,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-26 16:16:04,712 INFO L438 stractBuchiCegarLoop]: Abstraction has 779 states and 1822 transitions. [2025-04-26 16:16:04,712 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:16:04,712 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 779 states and 1822 transitions. [2025-04-26 16:16:04,716 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 320 [2025-04-26 16:16:04,716 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:04,716 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:04,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:04,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:16:04,719 INFO L752 eck$LassoCheckResult]: Stem: "[271] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[278] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[329] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[348] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 20) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[300] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[289] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0]" "[349] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[298] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0]" "[267] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0]" "[357] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[359] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_5|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_5|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, 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]" "[303] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[307] L72-1-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[313] L74-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0]" "[294] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[270] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[~n~0]" "[347] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[304] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2| 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_2|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[346] 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_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] L76-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[268] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_8|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[274] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[291] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[302] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[]" "[292] 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[340] L92-->L92-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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_#in~cond#1]" "[333] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[263] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1]" "[276] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[272] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[350] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length]" "[315] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} 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_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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]" "[334] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base]" "[323] L95-->L95-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[252] L95-5-->L95-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |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|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[]" "[312] L95-6-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[331] L98-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[342] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret9#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[258] L76-3-->L76-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_4|, 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_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[309] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[354] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[254] L76-6-->L79: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[286] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[343] 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]" "[273] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre10#1_2|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[389] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= 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_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, 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_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[293] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[262] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[259] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[345] 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]" "[264] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[386] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= 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_#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_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, 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_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1]" "[373] $Ultimate##0-->L66: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[362] $Ultimate##0-->L53: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:04,719 INFO L754 eck$LassoCheckResult]: Loop: "[375] L66-->L59-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[377] L59-1-->L59-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[379] L59-2-->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[]" "[381] L59-3-->L59-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[383] L59-4-->L66: Formula: (let ((.cse0 (* v_~front~0_69 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_27))) (and (= (+ v_~size~0_69 1) v_~size~0_70) (not (= (ite (< 0 v_~size~0_70) 1 0) 0)) (= (+ v_~front~0_69 1) v_~front~0_68) (<= (+ .cse0 4 v_~queue~0.offset_27) (select |v_#length_30| v_~queue~0.base_27)) (= (select |v_#valid_31| v_~queue~0.base_27) 1) (not (= (ite (and (< v_~front~0_69 v_~n~0_26) (<= 0 v_~front~0_69)) 1 0) 0)) (= v_~x~0_11 (select (select |v_#memory_int_29| v_~queue~0.base_27) .cse1)) (<= 0 .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_27, ~size~0=v_~size~0_70, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_29|, #length=|v_#length_30|, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_26, ~front~0=v_~front~0_69} OutVars{~queue~0.offset=v_~queue~0.offset_27, ~size~0=v_~size~0_69, 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_27, 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_31|, #memory_int=|v_#memory_int_29|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_30|, ~n~0=v_~n~0_26, ~x~0=v_~x~0_11, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|, ~front~0=v_~front~0_68} 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]" [2025-04-26 16:16:04,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1276844525, now seen corresponding path program 1 times [2025-04-26 16:16:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:04,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292350894] [2025-04-26 16:16:04,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:04,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-26 16:16:04,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-26 16:16:04,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:04,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:04,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:04,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-26 16:16:04,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-26 16:16:04,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:04,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:04,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:04,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:04,763 INFO L85 PathProgramCache]: Analyzing trace with hash 386557146, now seen corresponding path program 1 times [2025-04-26 16:16:04,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:04,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049717405] [2025-04-26 16:16:04,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:04,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:04,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:04,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:04,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:04,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:04,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:04,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:04,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:04,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:04,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:04,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1605279342, now seen corresponding path program 1 times [2025-04-26 16:16:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:04,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022142512] [2025-04-26 16:16:04,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:04,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-26 16:16:04,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:16:04,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:04,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:04,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:04,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-26 16:16:04,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:16:04,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:04,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:04,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:05,730 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:16:05,730 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:16:05,730 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:16:05,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:16:05,730 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:16:05,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:05,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:16:05,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:16:05,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_petrified1_Iteration4_Lasso [2025-04-26 16:16:05,731 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:16:05,731 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:16:05,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:05,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:06,400 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:16:06,401 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:16:06,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:06,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:06,403 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:06,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:16:06,405 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 [2025-04-26 16:16:06,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:06,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:06,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:06,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:06,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:06,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:06,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:06,416 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:06,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:16:06,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:06,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:06,425 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:06,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:16:06,427 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 [2025-04-26 16:16:06,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:06,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:06,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:06,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:06,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:06,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:06,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:06,438 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:06,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:16:06,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:06,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:06,445 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:06,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:16:06,448 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 [2025-04-26 16:16:06,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:06,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:06,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:06,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:06,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:06,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:06,462 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:16:06,466 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:16:06,467 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:16:06,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:06,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:06,469 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:06,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:16:06,470 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:16:06,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:16:06,485 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:16:06,485 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:16:06,485 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~size~0) = 1*~size~0 Supporting invariants [] [2025-04-26 16:16:06,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:16:06,509 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-04-26 16:16:06,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:06,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-26 16:16:06,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-26 16:16:06,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:06,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:06,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:16:06,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:06,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:06,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:06,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:06,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:06,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:16:06,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:06,630 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:16:06,630 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 779 states and 1822 transitions. cyclomatic complexity: 1096 Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (in total 76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:06,673 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 779 states and 1822 transitions. cyclomatic complexity: 1096. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (in total 76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1801 states and 4579 transitions. Complement of second has 5 states. [2025-04-26 16:16:06,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:16:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (in total 76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-04-26 16:16:06,674 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 135 transitions. Stem has 71 letters. Loop has 5 letters. [2025-04-26 16:16:06,674 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:06,674 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 135 transitions. Stem has 76 letters. Loop has 5 letters. [2025-04-26 16:16:06,674 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:06,674 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 135 transitions. Stem has 71 letters. Loop has 10 letters. [2025-04-26 16:16:06,674 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:06,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1801 states and 4579 transitions. [2025-04-26 16:16:06,687 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 245 [2025-04-26 16:16:06,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1801 states to 1002 states and 2483 transitions. [2025-04-26 16:16:06,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 763 [2025-04-26 16:16:06,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 855 [2025-04-26 16:16:06,694 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1002 states and 2483 transitions. [2025-04-26 16:16:06,694 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:16:06,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1002 states and 2483 transitions. [2025-04-26 16:16:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states and 2483 transitions. [2025-04-26 16:16:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 780. [2025-04-26 16:16:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 780 states have (on average 2.482051282051282) internal successors, (in total 1936), 779 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1936 transitions. [2025-04-26 16:16:06,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 780 states and 1936 transitions. [2025-04-26 16:16:06,708 INFO L438 stractBuchiCegarLoop]: Abstraction has 780 states and 1936 transitions. [2025-04-26 16:16:06,708 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:16:06,708 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 780 states and 1936 transitions. [2025-04-26 16:16:06,716 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 245 [2025-04-26 16:16:06,716 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:06,716 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:06,716 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:06,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:16:06,717 INFO L752 eck$LassoCheckResult]: Stem: "[271] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[278] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[329] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[348] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 20) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[300] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[289] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0]" "[349] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[298] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0]" "[267] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0]" "[357] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[359] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_5|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_5|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, 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]" "[303] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[307] L72-1-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[313] L74-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0]" "[294] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[270] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[~n~0]" "[347] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[304] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2| 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_2|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[346] 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_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] L76-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[268] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_8|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[274] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[291] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[302] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[]" "[292] 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[340] L92-->L92-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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_#in~cond#1]" "[333] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[263] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1]" "[276] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[272] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[350] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length]" "[315] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} 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_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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]" "[334] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base]" "[323] L95-->L95-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[252] L95-5-->L95-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |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|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[]" "[312] L95-6-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[331] L98-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[342] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret9#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[258] L76-3-->L76-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_4|, 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_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[309] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[354] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[254] L76-6-->L79: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[286] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[343] 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]" "[273] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre10#1_2|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[389] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= 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_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, 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_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[293] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[262] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[259] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[345] 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]" "[264] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[386] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= 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_#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_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, 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_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1]" "[373] $Ultimate##0-->L66: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[375] L66-->L59-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[377] L59-1-->L59-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[362] $Ultimate##0-->L53: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[380] L59-2-->L59-5: Formula: (= (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_7| 256) 0) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_7|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_7|} AuxVars[] AssignedVars[]" [2025-04-26 16:16:06,717 INFO L754 eck$LassoCheckResult]: Loop: "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:06,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1215859665, now seen corresponding path program 1 times [2025-04-26 16:16:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:06,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052923676] [2025-04-26 16:16:06,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:06,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-26 16:16:06,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:16:06,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:06,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:06,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:06,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-26 16:16:06,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:16:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:06,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:06,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash 376059791, now seen corresponding path program 3 times [2025-04-26 16:16:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:06,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578058176] [2025-04-26 16:16:06,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:16:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:06,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:06,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:06,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:16:06,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:06,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:06,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:06,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:06,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:06,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:06,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:06,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash -310342209, now seen corresponding path program 1 times [2025-04-26 16:16:06,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:06,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950474851] [2025-04-26 16:16:06,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:16:06,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:06,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-26 16:16:06,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-26 16:16:06,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:06,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:06,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:06,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-26 16:16:06,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-26 16:16:06,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:06,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:06,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:07,458 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:16:07,458 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:16:07,458 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:16:07,458 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:16:07,458 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:16:07,458 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:07,458 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:16:07,458 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:16:07,458 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_petrified1_Iteration5_Lasso [2025-04-26 16:16:07,458 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:16:07,458 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:16:07,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:07,987 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:16:07,987 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:16:07,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:07,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:07,989 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:07,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:16:07,992 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 [2025-04-26 16:16:08,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,003 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:08,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,010 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:16:08,011 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 [2025-04-26 16:16:08,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,024 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:08,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,031 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:16:08,033 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 [2025-04-26 16:16:08,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,046 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:16:08,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,053 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:16:08,054 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 [2025-04-26 16:16:08,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,065 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:08,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,072 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:16:08,074 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 [2025-04-26 16:16:08,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,086 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:16:08,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,094 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:16:08,096 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 [2025-04-26 16:16:08,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:08,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,118 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:16:08,119 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 [2025-04-26 16:16:08,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,130 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:16:08,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,137 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:16:08,139 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 [2025-04-26 16:16:08,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,149 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:16:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,156 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:16:08,158 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 [2025-04-26 16:16:08,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,169 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:16:08,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,176 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:16:08,177 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 [2025-04-26 16:16:08,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,188 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:16:08,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,195 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:16:08,197 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 [2025-04-26 16:16:08,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,210 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:16:08,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,217 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:16:08,218 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 [2025-04-26 16:16:08,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:16:08,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,239 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:16:08,241 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 [2025-04-26 16:16:08,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,253 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:16:08,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,260 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:16:08,262 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 [2025-04-26 16:16:08,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,273 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:16:08,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,280 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:16:08,281 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 [2025-04-26 16:16:08,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,293 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:16:08,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,300 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:16:08,302 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 [2025-04-26 16:16:08,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,316 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:08,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,324 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:16:08,325 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 [2025-04-26 16:16:08,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,340 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:16:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,348 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:16:08,350 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 [2025-04-26 16:16:08,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,364 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:16:08,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,373 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:16:08,374 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 [2025-04-26 16:16:08,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,388 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:16:08,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,395 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:16:08,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 [2025-04-26 16:16:08,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,410 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:16:08,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,417 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:16:08,419 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 [2025-04-26 16:16:08,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,432 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:16:08,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,439 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:16:08,443 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 [2025-04-26 16:16:08,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:08,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:08,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:08,454 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:16:08,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,461 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:16:08,462 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 [2025-04-26 16:16:08,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,476 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:08,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:16:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,483 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:16:08,485 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 [2025-04-26 16:16:08,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:08,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:08,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:08,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:08,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:08,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:08,506 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:16:08,522 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:16:08,522 INFO L437 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:16:08,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:08,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:08,524 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:08,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:16:08,525 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:16:08,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:16:08,541 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:16:08,541 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:16:08,541 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~size~0, v_rep(select #length ~queue~0.base)_2, ~front~0) = -2*~size~0 + 1*v_rep(select #length ~queue~0.base)_2 - 2*~front~0 Supporting invariants [1*v_rep(select #length ~queue~0.base)_2 - 2*~n~0 >= 0] [2025-04-26 16:16:08,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:16:08,561 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-04-26 16:16:08,563 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:16:08,563 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:16:08,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:08,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-26 16:16:08,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:16:08,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:08,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:08,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-26 16:16:08,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:09,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:09,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:09,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:09,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:09,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:16:09,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:09,068 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.15 stem predicates 1 loop predicates [2025-04-26 16:16:09,068 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 780 states and 1936 transitions. cyclomatic complexity: 1209 Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (in total 81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:09,849 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 780 states and 1936 transitions. cyclomatic complexity: 1209. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (in total 81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 927 states and 2350 transitions. Complement of second has 25 states. [2025-04-26 16:16:09,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 22 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:16:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (in total 81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 116 transitions. [2025-04-26 16:16:09,850 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 24 states and 116 transitions. Stem has 76 letters. Loop has 5 letters. [2025-04-26 16:16:09,850 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:09,850 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 24 states and 116 transitions. Stem has 81 letters. Loop has 5 letters. [2025-04-26 16:16:09,850 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:09,850 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 24 states and 116 transitions. Stem has 76 letters. Loop has 10 letters. [2025-04-26 16:16:09,850 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:09,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 927 states and 2350 transitions. [2025-04-26 16:16:09,858 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 185 [2025-04-26 16:16:09,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 927 states to 711 states and 1714 transitions. [2025-04-26 16:16:09,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2025-04-26 16:16:09,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2025-04-26 16:16:09,862 INFO L74 IsDeterministic]: Start isDeterministic. Operand 711 states and 1714 transitions. [2025-04-26 16:16:09,862 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:16:09,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 711 states and 1714 transitions. [2025-04-26 16:16:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states and 1714 transitions. [2025-04-26 16:16:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 708. [2025-04-26 16:16:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 708 states have (on average 2.4166666666666665) internal successors, (in total 1711), 707 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1711 transitions. [2025-04-26 16:16:09,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 708 states and 1711 transitions. [2025-04-26 16:16:09,874 INFO L438 stractBuchiCegarLoop]: Abstraction has 708 states and 1711 transitions. [2025-04-26 16:16:09,874 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:16:09,874 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 708 states and 1711 transitions. [2025-04-26 16:16:09,877 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 185 [2025-04-26 16:16:09,877 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:09,877 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:09,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:09,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:16:09,880 INFO L752 eck$LassoCheckResult]: Stem: "[271] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[278] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[329] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[348] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 20) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[300] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[289] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0]" "[349] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[298] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0]" "[267] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0]" "[357] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[359] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_5|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_5|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, 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]" "[303] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[307] L72-1-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[313] L74-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0]" "[294] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[270] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[~n~0]" "[347] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[304] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2| 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_2|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[346] 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_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] L76-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[268] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_8|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[274] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[291] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[302] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[]" "[292] 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[340] L92-->L92-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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_#in~cond#1]" "[333] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[263] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1]" "[276] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[272] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[350] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length]" "[315] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} 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_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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]" "[334] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base]" "[323] L95-->L95-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[252] L95-5-->L95-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |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|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[]" "[312] L95-6-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[331] L98-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[342] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret9#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[258] L76-3-->L76-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_4|, 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_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[309] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[354] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[254] L76-6-->L79: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[286] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[343] 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]" "[273] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre10#1_2|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[389] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= 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_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, 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_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[362] $Ultimate##0-->L53: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:09,881 INFO L754 eck$LassoCheckResult]: Loop: "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:09,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:09,881 INFO L85 PathProgramCache]: Analyzing trace with hash -601694685, now seen corresponding path program 3 times [2025-04-26 16:16:09,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:09,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126805796] [2025-04-26 16:16:09,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:16:09,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:09,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 3 equivalence classes. [2025-04-26 16:16:09,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:16:09,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:16:09,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:09,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:09,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-26 16:16:09,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:16:09,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:09,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:09,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:09,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 376059791, now seen corresponding path program 4 times [2025-04-26 16:16:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:09,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670336997] [2025-04-26 16:16:09,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:16:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:09,911 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:16:09,912 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:09,912 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:16:09,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:09,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:09,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:09,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:09,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:09,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:09,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:09,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1922638163, now seen corresponding path program 4 times [2025-04-26 16:16:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:09,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180433529] [2025-04-26 16:16:09,915 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:16:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:09,918 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-04-26 16:16:09,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 81 statements. [2025-04-26 16:16:09,924 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:16:09,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:10,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:16:10,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180433529] [2025-04-26 16:16:10,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180433529] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:16:10,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324412778] [2025-04-26 16:16:10,150 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:16:10,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:16:10,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:10,155 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:16:10,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-26 16:16:10,188 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-04-26 16:16:10,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 81 statements. [2025-04-26 16:16:10,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:16:10,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:10,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:16:10,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:10,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:16:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324412778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:16:10,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:16:10,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-04-26 16:16:10,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085209501] [2025-04-26 16:16:10,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:16:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:16:10,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-26 16:16:10,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1036, Unknown=0, NotChecked=0, Total=1332 [2025-04-26 16:16:10,985 INFO L87 Difference]: Start difference. First operand 708 states and 1711 transitions. cyclomatic complexity: 1044 Second operand has 37 states, 36 states have (on average 6.277777777777778) internal successors, (in total 226), 37 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:16:11,365 INFO L93 Difference]: Finished difference Result 2092 states and 5166 transitions. [2025-04-26 16:16:11,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2092 states and 5166 transitions. [2025-04-26 16:16:11,378 INFO L131 ngComponentsAnalysis]: Automaton has 68 accepting balls. 400 [2025-04-26 16:16:11,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2092 states to 2092 states and 5166 transitions. [2025-04-26 16:16:11,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1650 [2025-04-26 16:16:11,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1650 [2025-04-26 16:16:11,391 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2092 states and 5166 transitions. [2025-04-26 16:16:11,391 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:16:11,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2092 states and 5166 transitions. [2025-04-26 16:16:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states and 5166 transitions. [2025-04-26 16:16:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1268. [2025-04-26 16:16:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1268 states have (on average 2.4637223974763405) internal successors, (in total 3124), 1267 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 3124 transitions. [2025-04-26 16:16:11,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1268 states and 3124 transitions. [2025-04-26 16:16:11,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-26 16:16:11,425 INFO L438 stractBuchiCegarLoop]: Abstraction has 1268 states and 3124 transitions. [2025-04-26 16:16:11,425 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:16:11,425 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1268 states and 3124 transitions. [2025-04-26 16:16:11,431 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 260 [2025-04-26 16:16:11,431 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:11,431 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:11,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:11,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:16:11,434 INFO L752 eck$LassoCheckResult]: Stem: "[271] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[278] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[329] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[348] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 20) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[300] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[289] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0]" "[349] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[298] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0]" "[267] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0]" "[357] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[359] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_5|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_5|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, 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]" "[303] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[307] L72-1-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[313] L74-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0]" "[294] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[270] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[~n~0]" "[347] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[304] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2| 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_2|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[346] 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_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] L76-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[268] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_8|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[274] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[291] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[302] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[]" "[292] 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[340] L92-->L92-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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_#in~cond#1]" "[333] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[263] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1]" "[276] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[272] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[350] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length]" "[315] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} 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_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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]" "[334] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base]" "[323] L95-->L95-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[252] L95-5-->L95-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |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|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[]" "[312] L95-6-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[331] L98-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[342] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret9#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[258] L76-3-->L76-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_4|, 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_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[309] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[354] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[254] L76-6-->L79: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[286] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[343] 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]" "[273] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre10#1_2|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[389] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= 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_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, 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_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[362] $Ultimate##0-->L53: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:11,434 INFO L754 eck$LassoCheckResult]: Loop: "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:11,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash -818102995, now seen corresponding path program 5 times [2025-04-26 16:16:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:11,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578553867] [2025-04-26 16:16:11,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:16:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:11,443 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 83 statements into 4 equivalence classes. [2025-04-26 16:16:11,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:16:11,457 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-26 16:16:11,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:11,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:11,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-26 16:16:11,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:16:11,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:11,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:11,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:11,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash 376059791, now seen corresponding path program 5 times [2025-04-26 16:16:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:11,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082167665] [2025-04-26 16:16:11,472 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:16:11,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:11,475 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:11,477 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:11,477 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:16:11,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:11,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:11,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:11,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:11,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:11,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:11,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:11,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1001444835, now seen corresponding path program 6 times [2025-04-26 16:16:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:11,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484542692] [2025-04-26 16:16:11,480 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:16:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:11,487 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 88 statements into 4 equivalence classes. [2025-04-26 16:16:11,521 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:16:11,521 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-26 16:16:11,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:11,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:11,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-26 16:16:11,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:16:11,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:11,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:11,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:12,600 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:16:12,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:16:12,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:16:12,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:16:12,600 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:16:12,600 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:12,600 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:16:12,600 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:16:12,601 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_petrified1_Iteration7_Lasso [2025-04-26 16:16:12,601 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:16:12,601 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:16:12,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:12,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:13,259 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:16:13,260 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:16:13,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,261 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:16:13,264 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 [2025-04-26 16:16:13,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:13,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:13,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:13,275 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:13,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,282 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:16:13,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:16:13,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:13,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:13,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:13,295 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 16:16:13,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,302 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:16:13,303 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 [2025-04-26 16:16:13,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:13,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:13,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:13,314 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:16:13,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,321 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:16:13,323 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 [2025-04-26 16:16:13,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:13,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:13,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:13,334 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:16:13,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,341 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:16:13,342 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 [2025-04-26 16:16:13,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:13,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:13,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:13,353 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:13,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,361 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:16:13,362 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 [2025-04-26 16:16:13,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:13,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:13,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:13,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:13,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,380 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:16:13,382 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 [2025-04-26 16:16:13,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:13,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:13,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:13,393 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:16:13,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,400 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:16:13,402 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 [2025-04-26 16:16:13,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:13,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:13,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:13,412 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:16:13,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,419 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:16:13,421 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 [2025-04-26 16:16:13,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:16:13,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,440 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:16:13,441 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 [2025-04-26 16:16:13,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,454 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 16:16:13,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,460 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:16:13,462 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 [2025-04-26 16:16:13,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,475 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,481 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:16:13,483 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 [2025-04-26 16:16:13,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,497 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:16:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,505 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:16:13,507 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 [2025-04-26 16:16:13,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:16:13,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,529 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:16:13,532 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 [2025-04-26 16:16:13,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,546 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:13,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,553 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:16:13,554 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 [2025-04-26 16:16:13,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,569 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:13,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,576 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:16:13,578 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 [2025-04-26 16:16:13,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,592 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:16:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,599 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:16:13,601 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 [2025-04-26 16:16:13,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,614 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:13,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,621 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:16:13,623 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 [2025-04-26 16:16:13,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,635 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 16:16:13,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,642 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 16:16:13,645 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 [2025-04-26 16:16:13,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,657 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:13,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:13,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,664 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 16:16:13,666 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 [2025-04-26 16:16:13,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:13,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:13,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:13,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:13,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:13,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:13,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:16:13,709 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:16:13,709 INFO L437 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-04-26 16:16:13,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:13,711 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:13,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 16:16:13,712 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:16:13,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 16:16:13,728 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:16:13,728 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:16:13,728 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~front~0, v_rep(select #length ~queue~0.base)_3, ~size~0) = -4*~front~0 + 1*v_rep(select #length ~queue~0.base)_3 - 4*~size~0 Supporting invariants [] [2025-04-26 16:16:13,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 16:16:13,785 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2025-04-26 16:16:13,787 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:16:13,787 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:16:13,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:13,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-26 16:16:13,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:16:13,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:13,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:13,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:16:13,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:14,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:14,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:14,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:14,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:14,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:16:14,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:14,168 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 1 loop predicates [2025-04-26 16:16:14,168 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1268 states and 3124 transitions. cyclomatic complexity: 1927 Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (in total 74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:14,429 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1268 states and 3124 transitions. cyclomatic complexity: 1927. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (in total 74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2436 states and 6336 transitions. Complement of second has 15 states. [2025-04-26 16:16:14,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 12 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:16:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (in total 74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 116 transitions. [2025-04-26 16:16:14,431 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 116 transitions. Stem has 83 letters. Loop has 5 letters. [2025-04-26 16:16:14,431 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:14,431 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 116 transitions. Stem has 88 letters. Loop has 5 letters. [2025-04-26 16:16:14,431 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:14,431 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 116 transitions. Stem has 83 letters. Loop has 10 letters. [2025-04-26 16:16:14,431 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:14,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2436 states and 6336 transitions. [2025-04-26 16:16:14,444 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 215 [2025-04-26 16:16:14,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2436 states to 1523 states and 3802 transitions. [2025-04-26 16:16:14,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 736 [2025-04-26 16:16:14,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 973 [2025-04-26 16:16:14,453 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1523 states and 3802 transitions. [2025-04-26 16:16:14,453 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:16:14,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1523 states and 3802 transitions. [2025-04-26 16:16:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states and 3802 transitions. [2025-04-26 16:16:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1291. [2025-04-26 16:16:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1291 states have (on average 2.492641363284276) internal successors, (in total 3218), 1290 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 3218 transitions. [2025-04-26 16:16:14,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1291 states and 3218 transitions. [2025-04-26 16:16:14,478 INFO L438 stractBuchiCegarLoop]: Abstraction has 1291 states and 3218 transitions. [2025-04-26 16:16:14,478 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:16:14,478 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 3218 transitions. [2025-04-26 16:16:14,483 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 140 [2025-04-26 16:16:14,483 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:16:14,483 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:16:14,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:16:14,485 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:16:14,487 INFO L752 eck$LassoCheckResult]: Stem: "[271] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[278] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[329] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[348] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 20) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[300] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[289] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0]" "[349] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[298] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0]" "[267] L42-3-->L-1-1: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0]" "[357] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[359] L-1-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_5|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_5|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, 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]" "[303] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[307] L72-1-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[313] L74-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0]" "[294] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[270] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[~n~0]" "[347] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[304] L76-->L76-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2| 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_2|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[346] 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_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] L76-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[268] L91-->L91-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_8|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[274] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[291] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[302] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[]" "[292] 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[340] L92-->L92-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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_#in~cond#1]" "[333] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[263] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1]" "[276] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[272] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[350] L94-->L94-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length]" "[315] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} 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_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#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]" "[334] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base]" "[323] L95-->L95-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[253] L95-5-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[]" "[341] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[308] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|))) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (<= 0 .cse0)))) InVars {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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int]" "[266] L96-2-->L95-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1]" "[330] L95-2-->L95-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|} 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_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[344] L95-3-->L95-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} OutVars{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~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[282] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1]" "[252] L95-5-->L95-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |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|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[]" "[312] L95-6-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[331] L98-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[342] create_fresh_int_array_returnLabel#1-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret9#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[258] L76-3-->L76-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_4|, 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_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[309] 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[354] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[254] L76-6-->L79: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base]" "[286] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[343] 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]" "[273] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre10#1_2|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[389] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= 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_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, 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_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[293] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[262] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[259] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[345] 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]" "[264] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[386] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= 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_#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_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, 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_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1]" "[373] $Ultimate##0-->L66: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[362] $Ultimate##0-->L53: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" "[364] L53-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[366] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[368] L48-2-->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[]" "[370] L48-3-->L48-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[372] L48-4-->L53: Formula: (let ((.cse2 (* v_~size~0_60 4)) (.cse3 (* v_~front~0_60 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_23))) (and (not (= 0 (ite (let ((.cse0 (+ v_~front~0_60 v_~size~0_60))) (and (< .cse0 v_~n~0_20) (<= 0 .cse0))) 1 0))) (not (= (ite (= (select (select |v_#memory_int_25| v_~queue~0.base_23) .cse1) 5) 1 0) 0)) (<= 0 .cse1) (= (+ v_~size~0_60 1) v_~size~0_59) (= (select |v_#valid_27| v_~queue~0.base_23) 1) (<= (+ .cse2 4 .cse3 v_~queue~0.offset_23) (select |v_#length_26| v_~queue~0.base_23))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_60, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_25|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, ~front~0=v_~front~0_60} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_59, 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_27|, #memory_int=|v_#memory_int_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_26|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_60} 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]" [2025-04-26 16:16:14,487 INFO L754 eck$LassoCheckResult]: Loop: "[375] L66-->L59-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[377] L59-1-->L59-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[379] L59-2-->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[]" "[381] L59-3-->L59-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[383] L59-4-->L66: Formula: (let ((.cse0 (* v_~front~0_69 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_27))) (and (= (+ v_~size~0_69 1) v_~size~0_70) (not (= (ite (< 0 v_~size~0_70) 1 0) 0)) (= (+ v_~front~0_69 1) v_~front~0_68) (<= (+ .cse0 4 v_~queue~0.offset_27) (select |v_#length_30| v_~queue~0.base_27)) (= (select |v_#valid_31| v_~queue~0.base_27) 1) (not (= (ite (and (< v_~front~0_69 v_~n~0_26) (<= 0 v_~front~0_69)) 1 0) 0)) (= v_~x~0_11 (select (select |v_#memory_int_29| v_~queue~0.base_27) .cse1)) (<= 0 .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_27, ~size~0=v_~size~0_70, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_29|, #length=|v_#length_30|, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_26, ~front~0=v_~front~0_69} OutVars{~queue~0.offset=v_~queue~0.offset_27, ~size~0=v_~size~0_69, 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_27, 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_31|, #memory_int=|v_#memory_int_29|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_30|, ~n~0=v_~n~0_26, ~x~0=v_~x~0_11, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|, ~front~0=v_~front~0_68} 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]" [2025-04-26 16:16:14,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1378373677, now seen corresponding path program 2 times [2025-04-26 16:16:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:14,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805109387] [2025-04-26 16:16:14,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:16:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:14,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-04-26 16:16:14,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:16:14,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:16:14,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:14,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:14,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-26 16:16:14,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:16:14,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:14,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:14,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash 386557146, now seen corresponding path program 2 times [2025-04-26 16:16:14,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:14,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189104598] [2025-04-26 16:16:14,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:16:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:14,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:14,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:14,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:16:14,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:14,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:14,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:14,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:14,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:14,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:14,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:14,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1398190034, now seen corresponding path program 2 times [2025-04-26 16:16:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:16:14,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384349929] [2025-04-26 16:16:14,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:16:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:16:14,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-04-26 16:16:14,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:16:14,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:16:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:14,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:16:14,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-26 16:16:14,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:16:14,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:14,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:16:14,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:16:15,821 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:16:15,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:16:15,822 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:16:15,822 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:16:15,822 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:16:15,822 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:15,822 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:16:15,822 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:16:15,822 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_petrified1_Iteration8_Lasso [2025-04-26 16:16:15,822 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:16:15,822 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:16:15,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:15,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:15,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:15,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:15,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:15,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:15,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:15,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:15,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:16:16,428 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:16:16,428 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:16:16,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,432 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 16:16:16,434 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 [2025-04-26 16:16:16,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:16,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:16,447 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 16:16:16,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,456 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 16:16:16,459 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 [2025-04-26 16:16:16,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:16,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:16,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:16,476 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,484 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 16:16:16,486 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 [2025-04-26 16:16:16,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:16,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:16,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:16,497 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 16:16:16,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,506 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 16:16:16,508 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 [2025-04-26 16:16:16,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:16,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:16,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:16,519 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,527 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 16:16:16,530 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 [2025-04-26 16:16:16,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:16,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:16,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:16,541 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:16,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,549 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 16:16:16,554 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 [2025-04-26 16:16:16,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:16,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:16,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:16,565 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 16:16:16,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,576 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 16:16:16,577 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 [2025-04-26 16:16:16,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:16:16,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:16:16,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:16:16,588 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:16,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,596 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 16:16:16,598 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 [2025-04-26 16:16:16,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:16,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:16,610 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-04-26 16:16:16,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,617 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 16:16:16,620 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 [2025-04-26 16:16:16,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:16,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:16,633 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:16,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,641 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 16:16:16,643 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 [2025-04-26 16:16:16,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:16,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:16,659 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:16,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,684 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-04-26 16:16:16,689 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 [2025-04-26 16:16:16,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:16,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:16,706 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:16:16,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-04-26 16:16:16,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,713 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-04-26 16:16:16,715 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 [2025-04-26 16:16:16,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:16:16,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:16:16,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:16:16,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:16:16,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:16:16,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:16:16,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:16:16,747 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:16:16,747 INFO L437 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:16:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:16:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:16:16,749 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:16:16,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-04-26 16:16:16,750 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:16:16,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-04-26 16:16:16,765 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:16:16,765 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:16:16,765 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~front~0, v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_4) = -2*~front~0 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_4 Supporting invariants [] [2025-04-26 16:16:16,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-04-26 16:16:16,803 INFO L156 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2025-04-26 16:16:16,805 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:16:16,805 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:16:16,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:16:16,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-26 16:16:16,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:16:16,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:16,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:16,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:16:16,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:17,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:16:17,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:16:17,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:16:17,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:16:17,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:16:17,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:16:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:16:17,050 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 1 loop predicates [2025-04-26 16:16:17,050 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1291 states and 3218 transitions. cyclomatic complexity: 1998 Second operand has 8 states, 8 states have (on average 9.625) internal successors, (in total 77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:17,170 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1291 states and 3218 transitions. cyclomatic complexity: 1998. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (in total 77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2515 states and 6650 transitions. Complement of second has 12 states. [2025-04-26 16:16:17,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 9 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:16:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.625) internal successors, (in total 77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:16:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2025-04-26 16:16:17,171 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 125 transitions. Stem has 83 letters. Loop has 5 letters. [2025-04-26 16:16:17,171 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:17,171 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 125 transitions. Stem has 88 letters. Loop has 5 letters. [2025-04-26 16:16:17,171 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:17,171 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 125 transitions. Stem has 83 letters. Loop has 10 letters. [2025-04-26 16:16:17,172 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:16:17,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2515 states and 6650 transitions. [2025-04-26 16:16:17,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:16:17,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2515 states to 0 states and 0 transitions. [2025-04-26 16:16:17,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:16:17,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:16:17,187 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:16:17,187 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:16:17,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:16:17,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:16:17,187 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:16:17,187 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:16:17,187 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:16:17,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:16:17,187 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:16:17,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:16:17 BoogieIcfgContainer [2025-04-26 16:16:17,192 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:16:17,193 INFO L158 Benchmark]: Toolchain (without parser) took 17577.39ms. Allocated memory was 142.6MB in the beginning and 390.1MB in the end (delta: 247.5MB). Free memory was 100.1MB in the beginning and 178.6MB in the end (delta: -78.5MB). Peak memory consumption was 169.0MB. Max. memory is 8.0GB. [2025-04-26 16:16:17,194 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:16:17,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.84ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 85.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:16:17,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.21ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:16:17,194 INFO L158 Benchmark]: Boogie Preprocessor took 20.75ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:16:17,195 INFO L158 Benchmark]: RCFGBuilder took 397.53ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 59.7MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 16:16:17,195 INFO L158 Benchmark]: BuchiAutomizer took 16911.00ms. Allocated memory was 142.6MB in the beginning and 390.1MB in the end (delta: 247.5MB). Free memory was 59.7MB in the beginning and 178.6MB in the end (delta: -118.9MB). Peak memory consumption was 127.0MB. Max. memory is 8.0GB. [2025-04-26 16:16:17,196 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.18ms. Allocated memory is still 159.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.84ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 85.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.21ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.75ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 397.53ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 59.7MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 16911.00ms. Allocated memory was 142.6MB in the beginning and 390.1MB in the end (delta: 247.5MB). Free memory was 59.7MB in the beginning and 178.6MB in the end (delta: -118.9MB). Peak memory consumption was 127.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~arr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.8s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 12.6s. Construction of modules took 0.5s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 2055 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2765 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2763 mSDsluCounter, 3855 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3182 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 966 IncrementalHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 673 mSDtfsCounter, 966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital230 mio100 ax114 hnf100 lsp69 ukn79 mio100 lsp41 div148 bol100 ite100 ukn100 eq156 hnf92 smp82 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function size and consists of 3 locations. One deterministic module has affine ranking function null and consists of 24 locations. One deterministic module has affine ranking function null and consists of 14 locations. One deterministic module has affine ranking function null and consists of 11 locations. 3 modules have a trivial ranking function, the largest among these consists of 37 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:16:17,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-26 16:16:17,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:16:17,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...