/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:43:38,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:43:38,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:43:38,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:43:38,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:43:38,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:43:38,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:43:38,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:43:38,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:43:38,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:43:38,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:43:38,630 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:43:38,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:43:38,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:43:38,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:43:38,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:43:38,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:43:38,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:43:38,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:43:38,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:43:38,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:43:38,633 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:43:38,633 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:43:38,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:43:38,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:43:38,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:43:38,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:43:38,856 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:43:38,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2025-04-26 16:43:40,113 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ba56807a5/5a0ae3d4228e4d6ab2294c0244c8f624/FLAG78b164e5d [2025-04-26 16:43:40,334 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:43:40,334 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2025-04-26 16:43:40,343 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ba56807a5/5a0ae3d4228e4d6ab2294c0244c8f624/FLAG78b164e5d [2025-04-26 16:43:41,162 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ba56807a5/5a0ae3d4228e4d6ab2294c0244c8f624 [2025-04-26 16:43:41,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:43:41,166 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:43:41,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:43:41,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:43:41,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:43:41,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce18b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41, skipping insertion in model container [2025-04-26 16:43:41,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:43:41,349 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2025-04-26 16:43:41,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:43:41,364 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:43:41,387 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2025-04-26 16:43:41,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:43:41,400 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:43:41,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41 WrapperNode [2025-04-26 16:43:41,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:43:41,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:43:41,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:43:41,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:43:41,405 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:43:41" (1/1) ... [2025-04-26 16:43:41,412 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:43:41" (1/1) ... [2025-04-26 16:43:41,424 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 81 [2025-04-26 16:43:41,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:43:41,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:43:41,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:43:41,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:43:41,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:43:41,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:43:41,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:43:41,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:43:41,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (1/1) ... [2025-04-26 16:43:41,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:43:41,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:41,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:43:41,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:43:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:43:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:43:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:43:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:43:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:43:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:43:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:43:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:43:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 16:43:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-26 16:43:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-26 16:43:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 16:43:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:43:41,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:43:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 16:43:41,506 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:43:41,581 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:43:41,583 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:43:41,767 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:43:41,768 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:43:41,843 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:43:41,844 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:43:41,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:43:41 BoogieIcfgContainer [2025-04-26 16:43:41,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:43:41,845 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:43:41,845 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:43:41,850 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:43:41,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:43:41,851 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:43:41" (1/3) ... [2025-04-26 16:43:41,852 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4070ed78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:43:41, skipping insertion in model container [2025-04-26 16:43:41,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:43:41,852 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:43:41" (2/3) ... [2025-04-26 16:43:41,853 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4070ed78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:43:41, skipping insertion in model container [2025-04-26 16:43:41,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:43:41,853 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:43:41" (3/3) ... [2025-04-26 16:43:41,854 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2025-04-26 16:43:41,912 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:43:41,939 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:43:41,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:43:41,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:41,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:43:41,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:43:42,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 144 transitions, 309 flow [2025-04-26 16:43:42,033 INFO L116 PetriNetUnfolderBase]: 8/138 cut-off events. [2025-04-26 16:43:42,036 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:43:42,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 8/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2025-04-26 16:43:42,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 144 transitions, 309 flow [2025-04-26 16:43:42,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 138 transitions, 294 flow [2025-04-26 16:43:42,046 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 140 places, 138 transitions, 294 flow [2025-04-26 16:43:42,051 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:43:42,563 WARN L140 AmpleReduction]: Number of pruned transitions: 6929 [2025-04-26 16:43:42,563 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:43:42,563 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 460 [2025-04-26 16:43:42,563 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:124 [2025-04-26 16:43:42,563 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:2871 [2025-04-26 16:43:42,563 WARN L145 AmpleReduction]: Times succ was already a loop node:77 [2025-04-26 16:43:42,564 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:781 [2025-04-26 16:43:42,564 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:43:42,574 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3456 states, 3454 states have (on average 1.4594672843080487) internal successors, (in total 5041), 3455 states have internal predecessors, (5041), 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:43:42,580 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:43:42,580 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:43:42,580 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:43:42,580 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:43:42,580 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:43:42,580 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:43:42,580 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:43:42,580 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:43:42,587 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3456 states, 3454 states have (on average 1.4594672843080487) internal successors, (in total 5041), 3455 states have internal predecessors, (5041), 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:43:42,652 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 2322 [2025-04-26 16:43:42,652 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:42,652 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:42,658 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] [2025-04-26 16:43:42,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:43:42,658 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:43:42,663 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3456 states, 3454 states have (on average 1.4594672843080487) internal successors, (in total 5041), 3455 states have internal predecessors, (5041), 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:43:42,704 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 2322 [2025-04-26 16:43:42,705 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:42,705 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:42,705 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] [2025-04-26 16:43:42,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:43:42,711 INFO L752 eck$LassoCheckResult]: Stem: "[266] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[276] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[328] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[356] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[287] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[302] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[263] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[277] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[289] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[354] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[355] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[369] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[370] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[324] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[372] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[273] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[291] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[241] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[239] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[313] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[376] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[292] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[245] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[242] L87-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[250] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[357] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L106-1-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[366] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[353] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[290] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[367] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[362] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[340] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[270] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[311] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[305] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[344] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[363] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[368] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[309] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" [2025-04-26 16:43:42,712 INFO L754 eck$LassoCheckResult]: Loop: "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" [2025-04-26 16:43:42,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash -284392684, now seen corresponding path program 1 times [2025-04-26 16:43:42,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:42,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305071386] [2025-04-26 16:43:42,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:42,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:43:42,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:43:42,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:42,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:42,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:42,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:43:42,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:43:42,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:42,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:42,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1506598124, now seen corresponding path program 1 times [2025-04-26 16:43:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:42,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544451360] [2025-04-26 16:43:42,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:42,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:43:42,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:43:42,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:42,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:42,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:43:42,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:43:42,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:42,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:42,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:42,869 INFO L85 PathProgramCache]: Analyzing trace with hash -514616159, now seen corresponding path program 1 times [2025-04-26 16:43:42,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:42,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412739557] [2025-04-26 16:43:42,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:42,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:43:42,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:43:42,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:42,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:42,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:42,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:43:42,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:43:42,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:42,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:42,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:43,321 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:43:43,322 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:43:43,322 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:43:43,322 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:43:43,323 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:43:43,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:43,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:43:43,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:43:43,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array-hom.wvr.c_petrified1_Iteration1_Lasso [2025-04-26 16:43:43,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:43:43,323 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:43:43,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,977 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:43:43,979 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:43:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:43,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:43,982 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:43:43,983 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:43:43,984 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:43:43,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:43,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:43,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:43,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:43,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:43,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:43,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,000 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,006 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:43:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,008 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:43:44,008 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:43:44,010 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:43:44,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:44,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:44,028 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,033 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:43:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,035 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:43:44,037 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:43:44,038 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:43:44,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,049 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,056 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:43:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,058 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:43:44,059 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:43:44,061 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:43:44,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,073 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:44,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,080 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:43:44,080 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:43:44,081 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:43:44,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,093 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:43:44,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,100 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:43:44,102 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:43:44,102 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:43:44,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,114 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:43:44,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,122 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:43:44,123 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:43:44,124 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:43:44,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:44,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:44,139 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:43:44,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,171 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:43:44,173 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:43:44,174 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:43:44,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,186 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:43:44,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,193 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:43:44,194 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:43:44,195 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:43:44,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:44,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:44,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:43:44,252 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 16:43:44,252 INFO L437 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:43:44,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,255 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:43:44,256 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:43:44,257 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:43:44,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:43:44,273 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:43:44,273 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:43:44,273 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2025-04-26 16:43:44,279 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:43:44,292 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:43:44,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:44,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:43:44,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:43:44,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:44,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:44,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:43:44,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:44,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:43:44,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:43:44,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:44,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:44,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:43:44,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:44,462 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:43:44,475 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:43:44,480 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 3456 states, 3454 states have (on average 1.4594672843080487) internal successors, (in total 5041), 3455 states have internal predecessors, (5041), 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) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (in total 50), 5 states have internal predecessors, (50), 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:43:44,619 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 3456 states, 3454 states have (on average 1.4594672843080487) internal successors, (in total 5041), 3455 states have internal predecessors, (5041), 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). Second operand has 5 states, 5 states have (on average 10.0) internal successors, (in total 50), 5 states have internal predecessors, (50), 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 6891 states and 10063 transitions. Complement of second has 10 states. [2025-04-26 16:43:44,620 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:43:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (in total 50), 5 states have internal predecessors, (50), 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:43:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2025-04-26 16:43:44,628 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 162 transitions. Stem has 43 letters. Loop has 7 letters. [2025-04-26 16:43:44,629 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:44,629 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 162 transitions. Stem has 50 letters. Loop has 7 letters. [2025-04-26 16:43:44,629 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:44,629 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 162 transitions. Stem has 43 letters. Loop has 14 letters. [2025-04-26 16:43:44,630 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:44,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6891 states and 10063 transitions. [2025-04-26 16:43:44,678 INFO L131 ngComponentsAnalysis]: Automaton has 219 accepting balls. 2315 [2025-04-26 16:43:44,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6891 states to 3231 states and 4724 transitions. [2025-04-26 16:43:44,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3222 [2025-04-26 16:43:44,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3224 [2025-04-26 16:43:44,718 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3231 states and 4724 transitions. [2025-04-26 16:43:44,720 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:44,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3231 states and 4724 transitions. [2025-04-26 16:43:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states and 4724 transitions. [2025-04-26 16:43:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3230. [2025-04-26 16:43:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3230 states, 3230 states have (on average 1.4622291021671827) internal successors, (in total 4723), 3229 states have internal predecessors, (4723), 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:43:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 4723 transitions. [2025-04-26 16:43:44,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3230 states and 4723 transitions. [2025-04-26 16:43:44,841 INFO L438 stractBuchiCegarLoop]: Abstraction has 3230 states and 4723 transitions. [2025-04-26 16:43:44,842 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:43:44,842 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3230 states and 4723 transitions. [2025-04-26 16:43:44,856 INFO L131 ngComponentsAnalysis]: Automaton has 219 accepting balls. 2315 [2025-04-26 16:43:44,856 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:44,856 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:44,859 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] [2025-04-26 16:43:44,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:44,860 INFO L752 eck$LassoCheckResult]: Stem: "[266] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[276] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[328] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[356] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[287] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[302] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[263] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[277] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[289] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[354] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[355] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[369] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[370] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[324] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[372] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[273] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[291] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[241] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[239] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[313] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[376] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[292] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[245] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[242] L87-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[250] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[357] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L106-1-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[366] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[353] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[290] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[367] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[362] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[340] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[270] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[311] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[305] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[344] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[363] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[368] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[309] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[253] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[256] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[349] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[255] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[271] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[303] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[251] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[310] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[288] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[262] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[308] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[284] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[319] L89-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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[300] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[418] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[377] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[378] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" [2025-04-26 16:43:44,861 INFO L754 eck$LassoCheckResult]: Loop: "[380] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[382] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[384] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[386] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[387] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" [2025-04-26 16:43:44,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1843805820, now seen corresponding path program 1 times [2025-04-26 16:43:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:44,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776699245] [2025-04-26 16:43:44,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:44,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:43:44,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:43:44,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:44,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:45,188 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:43:45,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:43:45,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776699245] [2025-04-26 16:43:45,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776699245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:43:45,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:43:45,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-26 16:43:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457255214] [2025-04-26 16:43:45,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:43:45,190 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:43:45,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash 391328670, now seen corresponding path program 1 times [2025-04-26 16:43:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:45,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452001754] [2025-04-26 16:43:45,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:45,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:45,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:45,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:45,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:45,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:45,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:43:45,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:43:45,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:43:45,303 INFO L87 Difference]: Start difference. First operand 3230 states and 4723 transitions. cyclomatic complexity: 1713 Second operand has 8 states, 8 states have (on average 7.875) internal successors, (in total 63), 8 states have internal predecessors, (63), 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:43:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:43:45,483 INFO L93 Difference]: Finished difference Result 3247 states and 4738 transitions. [2025-04-26 16:43:45,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3247 states and 4738 transitions. [2025-04-26 16:43:45,499 INFO L131 ngComponentsAnalysis]: Automaton has 219 accepting balls. 2315 [2025-04-26 16:43:45,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3247 states to 3234 states and 4725 transitions. [2025-04-26 16:43:45,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3222 [2025-04-26 16:43:45,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3222 [2025-04-26 16:43:45,517 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3234 states and 4725 transitions. [2025-04-26 16:43:45,526 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:45,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3234 states and 4725 transitions. [2025-04-26 16:43:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states and 4725 transitions. [2025-04-26 16:43:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 3229. [2025-04-26 16:43:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3229 states have (on average 1.4617528646639826) internal successors, (in total 4720), 3228 states have internal predecessors, (4720), 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:43:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4720 transitions. [2025-04-26 16:43:45,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3229 states and 4720 transitions. [2025-04-26 16:43:45,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:43:45,585 INFO L438 stractBuchiCegarLoop]: Abstraction has 3229 states and 4720 transitions. [2025-04-26 16:43:45,585 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:43:45,585 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3229 states and 4720 transitions. [2025-04-26 16:43:45,595 INFO L131 ngComponentsAnalysis]: Automaton has 219 accepting balls. 2315 [2025-04-26 16:43:45,595 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:45,596 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:45,596 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] [2025-04-26 16:43:45,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:45,597 INFO L752 eck$LassoCheckResult]: Stem: "[266] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[276] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[328] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[356] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[287] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[302] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[263] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[277] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[289] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[354] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[355] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[369] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[370] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[324] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[372] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[273] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[291] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[241] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[239] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[313] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[376] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[292] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[245] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[242] L87-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[250] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[357] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L106-1-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[366] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[353] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[290] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[367] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[362] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[340] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[270] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[311] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[305] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[344] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[363] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[368] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[309] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[253] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[256] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[349] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[255] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[271] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[303] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[251] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[310] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[288] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[262] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[308] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[284] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[319] L89-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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[300] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[418] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[377] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[378] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" [2025-04-26 16:43:45,598 INFO L754 eck$LassoCheckResult]: Loop: "[380] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[382] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[384] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[386] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[387] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" [2025-04-26 16:43:45,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1892022391, now seen corresponding path program 1 times [2025-04-26 16:43:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:45,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645634523] [2025-04-26 16:43:45,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:43:45,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:43:45,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:45,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:43:45,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:43:45,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:45,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash 391328670, now seen corresponding path program 2 times [2025-04-26 16:43:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:45,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150140590] [2025-04-26 16:43:45,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:45,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:45,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:45,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:43:45,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:45,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:45,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:45,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:45,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -698834666, now seen corresponding path program 1 times [2025-04-26 16:43:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:45,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387550349] [2025-04-26 16:43:45,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:45,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-26 16:43:45,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-26 16:43:45,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-26 16:43:45,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-26 16:43:45,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:46,373 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:43:46,373 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:43:46,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:43:46,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:43:46,373 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:43:46,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:46,374 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:43:46,374 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:43:46,374 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array-hom.wvr.c_petrified1_Iteration3_Lasso [2025-04-26 16:43:46,374 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:43:46,374 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:43:46,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,088 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:43:47,089 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:43:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,090 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:43:47,101 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:43:47,102 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:43:47,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,114 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:43:47,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,121 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:43:47,122 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:43:47,123 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:43:47,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,134 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:43:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,141 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:43:47,141 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:43:47,142 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:43:47,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,153 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:43:47,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,160 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:43:47,160 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:43:47,161 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:43:47,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,172 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:43:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,179 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:43:47,180 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:43:47,181 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:43:47,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,192 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,198 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:43:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,200 INFO L229 MonitoredProcess]: Starting monitored process 18 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:43:47,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:43:47,203 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:43:47,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,217 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:43:47,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,224 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:43:47,226 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:43:47,227 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:43:47,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,240 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,248 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:43:47,249 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:43:47,251 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:43:47,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,264 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,270 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:43:47,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,271 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:43:47,272 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:43:47,273 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:43:47,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,286 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,291 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:43:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,293 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:43:47,294 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:43:47,295 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:43:47,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,308 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,312 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:43:47,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,314 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:43:47,315 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:43:47,316 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:43:47,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,330 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:43:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,337 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:43:47,338 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:43:47,339 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:43:47,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,352 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,357 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:43:47,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,359 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:43:47,360 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:43:47,361 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:43:47,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,376 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,381 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:43:47,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,383 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:43:47,384 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:43:47,385 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:43:47,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,398 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:43:47,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,406 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:43:47,406 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:43:47,408 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:43:47,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,418 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:43:47,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,420 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:43:47,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,424 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,431 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:43:47,432 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:43:47,433 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:43:47,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,447 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:43:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,454 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:43:47,455 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:43:47,456 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:43:47,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,471 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,477 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:43:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,479 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:43:47,481 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:43:47,482 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:43:47,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,493 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:43:47,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,502 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:43:47,502 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:43:47,512 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,520 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:43:47,521 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:43:47,523 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:43:47,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:43:47,579 INFO L436 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2025-04-26 16:43:47,579 INFO L437 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-04-26 16:43:47,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,582 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:43:47,583 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:43:47,583 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:43:47,599 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:43:47,599 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:43:47,599 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:43:47,599 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_1, thread1Thread1of1ForFork2_~i~0) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_1 - 4*thread1Thread1of1ForFork2_~i~0 Supporting invariants [1*~A~0.offset >= 0] [2025-04-26 16:43:47,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,626 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2025-04-26 16:43:47,628 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:43:47,629 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:43:47,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:47,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:43:47,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:43:47,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:47,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:47,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:43:47,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:47,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:47,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:47,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:47,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:47,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:43:47,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:48,004 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:43:48,004 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2025-04-26 16:43:48,004 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3229 states and 4720 transitions. cyclomatic complexity: 1711 Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (in total 75), 11 states have internal predecessors, (75), 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:43:48,241 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3229 states and 4720 transitions. cyclomatic complexity: 1711. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (in total 75), 11 states have internal predecessors, (75), 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 5324 states and 7871 transitions. Complement of second has 17 states. [2025-04-26 16:43:48,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:43:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (in total 75), 11 states have internal predecessors, (75), 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:43:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 201 transitions. [2025-04-26 16:43:48,242 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 201 transitions. Stem has 70 letters. Loop has 5 letters. [2025-04-26 16:43:48,242 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:48,242 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 201 transitions. Stem has 75 letters. Loop has 5 letters. [2025-04-26 16:43:48,242 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:48,242 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 201 transitions. Stem has 70 letters. Loop has 10 letters. [2025-04-26 16:43:48,242 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:48,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5324 states and 7871 transitions. [2025-04-26 16:43:48,260 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 485 [2025-04-26 16:43:48,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5324 states to 3573 states and 5254 transitions. [2025-04-26 16:43:48,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1514 [2025-04-26 16:43:48,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1900 [2025-04-26 16:43:48,275 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3573 states and 5254 transitions. [2025-04-26 16:43:48,275 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:48,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3573 states and 5254 transitions. [2025-04-26 16:43:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states and 5254 transitions. [2025-04-26 16:43:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3443. [2025-04-26 16:43:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 3443 states have (on average 1.4882370026139995) internal successors, (in total 5124), 3442 states have internal predecessors, (5124), 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:43:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 5124 transitions. [2025-04-26 16:43:48,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3443 states and 5124 transitions. [2025-04-26 16:43:48,318 INFO L438 stractBuchiCegarLoop]: Abstraction has 3443 states and 5124 transitions. [2025-04-26 16:43:48,318 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:43:48,319 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3443 states and 5124 transitions. [2025-04-26 16:43:48,324 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 485 [2025-04-26 16:43:48,324 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:48,324 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:48,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:43:48,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:48,325 INFO L752 eck$LassoCheckResult]: Stem: "[266] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[276] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[328] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[356] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[287] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[302] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[263] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[277] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[289] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[354] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[355] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[369] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[370] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[324] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[372] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[273] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[291] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[241] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[239] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[313] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[376] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[292] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[245] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[242] L87-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[250] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[357] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L106-1-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[366] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[353] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[290] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[367] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[362] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[340] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[270] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[311] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[305] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[344] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[363] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[368] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[309] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[253] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[256] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[349] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[255] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[271] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[303] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[251] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[310] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[288] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[262] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[308] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[284] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[319] L89-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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[300] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[418] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[377] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[378] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[379] L46-4-->L46-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork2_~i~0_3) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[381] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[383] L54-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset]" "[385] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[318] L92-4-->L92-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[330] L92-5-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1]" "[272] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[351] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[331] L93-2-->L93-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre15#1_3|) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[412] L93-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_8|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_4|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[388] $Ultimate##0-->L58: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" "[389] L58-->L58-4: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" [2025-04-26 16:43:48,326 INFO L754 eck$LassoCheckResult]: Loop: "[391] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork0_~i~1_5 v_~M~0_1) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[]" "[393] L59-->L63: Formula: (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_37))) (let ((.cse0 (= (select |v_#valid_41| v_~A~0.base_37) 1)) (.cse2 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_37 4) (select |v_#length_40| v_~A~0.base_37)))) (and .cse0 (let ((.cse1 (select (select |v_#memory_int_39| v_~A~0.base_37) .cse4))) (or (and (= v_~max2~0_25 v_~max2~0_24) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse1 v_~max2~0_25)) (and (= v_~max2~0_24 .cse1) .cse0 .cse2 .cse3 (< v_~max2~0_25 .cse1)))) .cse2 .cse3)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_25, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_24, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[395] L63-->L58-2: Formula: (= |v_thread2Thread1of1ForFork0_#t~post6_1| v_thread2Thread1of1ForFork0_~i~1_11) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" "[397] L58-2-->L58-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post6_3| 1) v_thread2Thread1of1ForFork0_~i~1_13) InVars {thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_13, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[398] L58-3-->L58-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" [2025-04-26 16:43:48,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1363296346, now seen corresponding path program 1 times [2025-04-26 16:43:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:48,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450870848] [2025-04-26 16:43:48,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:48,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-26 16:43:48,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-26 16:43:48,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:43:48,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:43:48,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450870848] [2025-04-26 16:43:48,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450870848] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:43:48,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658961611] [2025-04-26 16:43:48,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:48,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:43:48,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:48,478 INFO L229 MonitoredProcess]: Starting monitored process 33 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:43:48,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-26 16:43:48,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-26 16:43:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-26 16:43:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:48,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:43:48,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:43:48,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:43:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:43:48,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658961611] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-26 16:43:48,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-26 16:43:48,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2025-04-26 16:43:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531670906] [2025-04-26 16:43:48,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:43:48,743 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:43:48,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash 401826025, now seen corresponding path program 1 times [2025-04-26 16:43:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:48,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292550084] [2025-04-26 16:43:48,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:48,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:48,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:48,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:48,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:48,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:48,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:48,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:48,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:48,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:48,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:43:48,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:43:48,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-04-26 16:43:48,826 INFO L87 Difference]: Start difference. First operand 3443 states and 5124 transitions. cyclomatic complexity: 1853 Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (in total 82), 7 states have internal predecessors, (82), 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:43:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:43:48,922 INFO L93 Difference]: Finished difference Result 3443 states and 5123 transitions. [2025-04-26 16:43:48,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3443 states and 5123 transitions. [2025-04-26 16:43:48,930 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 485 [2025-04-26 16:43:48,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3443 states to 3443 states and 5123 transitions. [2025-04-26 16:43:48,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1770 [2025-04-26 16:43:48,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1770 [2025-04-26 16:43:48,942 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3443 states and 5123 transitions. [2025-04-26 16:43:48,942 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:48,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3443 states and 5123 transitions. [2025-04-26 16:43:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states and 5123 transitions. [2025-04-26 16:43:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3443. [2025-04-26 16:43:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3443 states, 3443 states have (on average 1.4879465582340983) internal successors, (in total 5123), 3442 states have internal predecessors, (5123), 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:43:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 5123 transitions. [2025-04-26 16:43:48,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3443 states and 5123 transitions. [2025-04-26 16:43:48,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:43:48,981 INFO L438 stractBuchiCegarLoop]: Abstraction has 3443 states and 5123 transitions. [2025-04-26 16:43:48,981 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:43:48,981 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3443 states and 5123 transitions. [2025-04-26 16:43:48,986 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 485 [2025-04-26 16:43:48,986 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:48,986 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:48,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:43:48,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:48,988 INFO L752 eck$LassoCheckResult]: Stem: "[266] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[276] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[328] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[356] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[287] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[302] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[263] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[277] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[289] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[354] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[355] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[369] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[370] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[324] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[372] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[273] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[291] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[241] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[239] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[313] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[376] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[292] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[245] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[242] L87-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[250] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[357] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L106-1-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[366] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[353] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[290] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[367] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[362] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[340] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[270] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[311] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[305] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[344] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[363] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[368] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[309] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[253] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[256] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[349] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[255] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[271] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[303] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[251] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[310] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[288] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[262] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[308] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[284] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[319] L89-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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[300] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[418] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[377] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[378] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[380] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[382] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[384] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[386] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[387] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[379] L46-4-->L46-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork2_~i~0_3) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[381] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[383] L54-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset]" "[385] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[318] L92-4-->L92-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[330] L92-5-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1]" "[272] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[351] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[331] L93-2-->L93-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre15#1_3|) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[412] L93-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_8|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_4|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[388] $Ultimate##0-->L58: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" "[389] L58-->L58-4: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" [2025-04-26 16:43:48,988 INFO L754 eck$LassoCheckResult]: Loop: "[391] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork0_~i~1_5 v_~M~0_1) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[]" "[393] L59-->L63: Formula: (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_37))) (let ((.cse0 (= (select |v_#valid_41| v_~A~0.base_37) 1)) (.cse2 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_37 4) (select |v_#length_40| v_~A~0.base_37)))) (and .cse0 (let ((.cse1 (select (select |v_#memory_int_39| v_~A~0.base_37) .cse4))) (or (and (= v_~max2~0_25 v_~max2~0_24) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse1 v_~max2~0_25)) (and (= v_~max2~0_24 .cse1) .cse0 .cse2 .cse3 (< v_~max2~0_25 .cse1)))) .cse2 .cse3)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_25, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_24, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[395] L63-->L58-2: Formula: (= |v_thread2Thread1of1ForFork0_#t~post6_1| v_thread2Thread1of1ForFork0_~i~1_11) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" "[397] L58-2-->L58-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post6_3| 1) v_thread2Thread1of1ForFork0_~i~1_13) InVars {thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_13, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[398] L58-3-->L58-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" [2025-04-26 16:43:48,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2006061465, now seen corresponding path program 1 times [2025-04-26 16:43:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:48,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736165872] [2025-04-26 16:43:48,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:48,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-26 16:43:49,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-26 16:43:49,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:49,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:49,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-26 16:43:49,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-26 16:43:49,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:49,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:49,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:49,032 INFO L85 PathProgramCache]: Analyzing trace with hash 401826025, now seen corresponding path program 2 times [2025-04-26 16:43:49,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:49,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331686590] [2025-04-26 16:43:49,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:49,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:49,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:49,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:49,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:43:49,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:49,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:49,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:49,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:49,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:49,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:49,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1692892605, now seen corresponding path program 1 times [2025-04-26 16:43:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:49,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854263079] [2025-04-26 16:43:49,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:49,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-26 16:43:49,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-26 16:43:49,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:43:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:43:49,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854263079] [2025-04-26 16:43:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854263079] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:43:49,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848448546] [2025-04-26 16:43:49,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:49,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:43:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:49,368 INFO L229 MonitoredProcess]: Starting monitored process 34 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:43:49,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-26 16:43:49,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-26 16:43:49,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-26 16:43:49,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:49,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:43:49,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:43:49,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:43:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:43:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848448546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:43:49,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:43:49,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2025-04-26 16:43:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542741446] [2025-04-26 16:43:49,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:43:49,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:43:49,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-26 16:43:49,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2025-04-26 16:43:49,967 INFO L87 Difference]: Start difference. First operand 3443 states and 5123 transitions. cyclomatic complexity: 1852 Second operand has 31 states, 31 states have (on average 6.612903225806452) internal successors, (in total 205), 31 states have internal predecessors, (205), 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:43:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:43:50,693 INFO L93 Difference]: Finished difference Result 5224 states and 7663 transitions. [2025-04-26 16:43:50,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5224 states and 7663 transitions. [2025-04-26 16:43:50,707 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 560 [2025-04-26 16:43:50,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5224 states to 4993 states and 7343 transitions. [2025-04-26 16:43:50,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2521 [2025-04-26 16:43:50,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2521 [2025-04-26 16:43:50,731 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4993 states and 7343 transitions. [2025-04-26 16:43:50,731 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:50,731 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4993 states and 7343 transitions. [2025-04-26 16:43:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states and 7343 transitions. [2025-04-26 16:43:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 3998. [2025-04-26 16:43:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3998 states, 3998 states have (on average 1.4822411205602801) internal successors, (in total 5926), 3997 states have internal predecessors, (5926), 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:43:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3998 states and 5926 transitions. [2025-04-26 16:43:50,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3998 states and 5926 transitions. [2025-04-26 16:43:50,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-26 16:43:50,807 INFO L438 stractBuchiCegarLoop]: Abstraction has 3998 states and 5926 transitions. [2025-04-26 16:43:50,807 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:43:50,807 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3998 states and 5926 transitions. [2025-04-26 16:43:50,817 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 485 [2025-04-26 16:43:50,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:50,817 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:50,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:43:50,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:50,819 INFO L752 eck$LassoCheckResult]: Stem: "[266] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[276] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[328] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[356] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[287] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[302] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[263] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[277] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[289] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[354] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[355] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[369] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[370] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[324] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[372] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[273] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[291] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[241] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[239] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[313] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[376] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[292] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[245] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[242] L87-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[250] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[357] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L106-1-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[366] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[353] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[290] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[367] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[362] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[340] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[270] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[311] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[305] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[344] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[363] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[368] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[309] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[253] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[256] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[349] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[255] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[271] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[303] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[251] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[310] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[288] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[262] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[308] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[284] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[319] L89-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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[300] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[418] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[377] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[378] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[380] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[382] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[384] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[386] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[387] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[379] L46-4-->L46-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork2_~i~0_3) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[381] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[383] L54-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset]" "[385] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[318] L92-4-->L92-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[330] L92-5-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1]" "[272] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[351] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[331] L93-2-->L93-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre15#1_3|) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[412] L93-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_8|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_4|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[388] $Ultimate##0-->L58: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" "[389] L58-->L58-4: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" [2025-04-26 16:43:50,819 INFO L754 eck$LassoCheckResult]: Loop: "[391] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork0_~i~1_5 v_~M~0_1) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[]" "[393] L59-->L63: Formula: (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_37))) (let ((.cse0 (= (select |v_#valid_41| v_~A~0.base_37) 1)) (.cse2 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_37 4) (select |v_#length_40| v_~A~0.base_37)))) (and .cse0 (let ((.cse1 (select (select |v_#memory_int_39| v_~A~0.base_37) .cse4))) (or (and (= v_~max2~0_25 v_~max2~0_24) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse1 v_~max2~0_25)) (and (= v_~max2~0_24 .cse1) .cse0 .cse2 .cse3 (< v_~max2~0_25 .cse1)))) .cse2 .cse3)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_25, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_24, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[395] L63-->L58-2: Formula: (= |v_thread2Thread1of1ForFork0_#t~post6_1| v_thread2Thread1of1ForFork0_~i~1_11) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" "[397] L58-2-->L58-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post6_3| 1) v_thread2Thread1of1ForFork0_~i~1_13) InVars {thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_13, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[398] L58-3-->L58-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" [2025-04-26 16:43:50,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1135255668, now seen corresponding path program 2 times [2025-04-26 16:43:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:50,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621193147] [2025-04-26 16:43:50,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:50,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-04-26 16:43:50,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-04-26 16:43:50,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:43:50,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:43:51,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:43:51,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621193147] [2025-04-26 16:43:51,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621193147] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:43:51,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797242258] [2025-04-26 16:43:51,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:51,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:43:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:51,016 INFO L229 MonitoredProcess]: Starting monitored process 35 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:43:51,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-26 16:43:51,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-04-26 16:43:51,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-04-26 16:43:51,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:43:51,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:51,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:43:51,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:43:51,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:43:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:43:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797242258] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:43:51,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:43:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2025-04-26 16:43:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854460908] [2025-04-26 16:43:51,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:43:51,387 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:43:51,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash 401826025, now seen corresponding path program 3 times [2025-04-26 16:43:51,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:51,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613142798] [2025-04-26 16:43:51,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:43:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:51,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:51,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:51,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:43:51,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:51,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:51,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:51,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:43:51,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-26 16:43:51,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2025-04-26 16:43:51,467 INFO L87 Difference]: Start difference. First operand 3998 states and 5926 transitions. cyclomatic complexity: 2130 Second operand has 27 states, 27 states have (on average 6.2592592592592595) internal successors, (in total 169), 27 states have internal predecessors, (169), 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:43:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:43:51,775 INFO L93 Difference]: Finished difference Result 5005 states and 7357 transitions. [2025-04-26 16:43:51,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5005 states and 7357 transitions. [2025-04-26 16:43:51,786 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 560 [2025-04-26 16:43:51,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5005 states to 5002 states and 7354 transitions. [2025-04-26 16:43:51,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2521 [2025-04-26 16:43:51,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2521 [2025-04-26 16:43:51,826 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5002 states and 7354 transitions. [2025-04-26 16:43:51,826 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:51,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5002 states and 7354 transitions. [2025-04-26 16:43:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states and 7354 transitions. [2025-04-26 16:43:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4002. [2025-04-26 16:43:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4002 states, 4002 states have (on average 1.4820089955022488) internal successors, (in total 5931), 4001 states have internal predecessors, (5931), 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:43:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 5931 transitions. [2025-04-26 16:43:51,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4002 states and 5931 transitions. [2025-04-26 16:43:51,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-26 16:43:51,878 INFO L438 stractBuchiCegarLoop]: Abstraction has 4002 states and 5931 transitions. [2025-04-26 16:43:51,878 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:43:51,878 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4002 states and 5931 transitions. [2025-04-26 16:43:51,887 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 485 [2025-04-26 16:43:51,887 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:51,887 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:51,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:43:51,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:51,889 INFO L752 eck$LassoCheckResult]: Stem: "[266] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[276] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[328] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[356] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[287] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[302] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[263] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[277] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[289] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[354] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[355] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[369] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[370] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[324] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[372] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[273] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[291] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[241] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[239] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[313] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[376] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[292] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[245] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[242] L87-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[250] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[357] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L106-1-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[366] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[353] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[290] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[367] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[362] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[340] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[270] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[311] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[305] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[344] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[363] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[368] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[309] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[253] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[256] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[349] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[255] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[271] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[303] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[251] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[310] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[288] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[262] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[308] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[284] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[319] L89-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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[300] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[418] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[377] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[378] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[380] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[382] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[384] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[386] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[387] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[380] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[382] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[384] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[386] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[387] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[379] L46-4-->L46-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork2_~i~0_3) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[381] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[383] L54-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset]" "[385] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[318] L92-4-->L92-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[330] L92-5-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1]" "[272] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[351] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[331] L93-2-->L93-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre15#1_3|) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[412] L93-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_8|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_4|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[388] $Ultimate##0-->L58: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" "[389] L58-->L58-4: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" [2025-04-26 16:43:51,890 INFO L754 eck$LassoCheckResult]: Loop: "[391] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork0_~i~1_5 v_~M~0_1) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[]" "[393] L59-->L63: Formula: (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_37))) (let ((.cse0 (= (select |v_#valid_41| v_~A~0.base_37) 1)) (.cse2 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_37 4) (select |v_#length_40| v_~A~0.base_37)))) (and .cse0 (let ((.cse1 (select (select |v_#memory_int_39| v_~A~0.base_37) .cse4))) (or (and (= v_~max2~0_25 v_~max2~0_24) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse1 v_~max2~0_25)) (and (= v_~max2~0_24 .cse1) .cse0 .cse2 .cse3 (< v_~max2~0_25 .cse1)))) .cse2 .cse3)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_25, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_24, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[395] L63-->L58-2: Formula: (= |v_thread2Thread1of1ForFork0_#t~post6_1| v_thread2Thread1of1ForFork0_~i~1_11) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" "[397] L58-2-->L58-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post6_3| 1) v_thread2Thread1of1ForFork0_~i~1_13) InVars {thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_13, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[398] L58-3-->L58-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" [2025-04-26 16:43:51,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:51,890 INFO L85 PathProgramCache]: Analyzing trace with hash -727740787, now seen corresponding path program 3 times [2025-04-26 16:43:51,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:51,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452795472] [2025-04-26 16:43:51,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:43:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:51,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 3 equivalence classes. [2025-04-26 16:43:51,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 99 of 99 statements. [2025-04-26 16:43:51,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:43:51,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:51,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-26 16:43:51,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-26 16:43:51,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:51,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash 401826025, now seen corresponding path program 4 times [2025-04-26 16:43:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:51,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902717608] [2025-04-26 16:43:51,953 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:43:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:51,955 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:43:51,956 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:43:51,956 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:43:51,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:51,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:51,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:51,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:51,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1916597795, now seen corresponding path program 2 times [2025-04-26 16:43:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:51,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673719416] [2025-04-26 16:43:51,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:51,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-04-26 16:43:51,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-04-26 16:43:51,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:43:51,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:51,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-26 16:43:51,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-26 16:43:51,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:52,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:53,337 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:43:53,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:43:53,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:43:53,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:43:53,338 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:43:53,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:43:53,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:43:53,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array-hom.wvr.c_petrified1_Iteration7_Lasso [2025-04-26 16:43:53,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:43:53,338 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:43:53,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:54,428 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:43:54,428 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:43:54,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,430 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:43:54,431 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:43:54,433 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:43:54,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,444 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:54,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,451 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:43:54,452 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:43:54,454 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:43:54,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,464 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:54,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,472 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:43:54,472 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:43:54,473 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:43:54,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,486 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:43:54,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,494 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:43:54,495 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:43:54,497 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:43:54,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,510 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:54,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,517 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:43:54,518 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:43:54,519 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:43:54,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,532 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,537 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:43:54,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,538 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:43:54,540 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:43:54,541 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:43:54,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,553 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:54,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,561 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:43:54,563 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:43:54,563 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:43:54,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,576 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,585 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:43:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,587 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:43:54,589 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:43:54,590 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:43:54,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,601 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:54,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,608 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:43:54,608 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:43:54,610 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:43:54,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,622 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,627 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:43:54,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,629 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:43:54,630 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:43:54,631 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:43:54,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,643 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:54,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,650 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:43:54,650 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:43:54,651 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:43:54,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,664 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,669 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:43:54,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,671 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:43:54,672 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:43:54,673 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:43:54,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,683 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,688 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:43:54,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,690 INFO L229 MonitoredProcess]: Starting monitored process 48 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:43:54,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:43:54,692 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:43:54,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,702 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 16:43:54,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,709 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:43:54,710 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:43:54,711 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:43:54,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,721 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,726 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:43:54,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,728 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:43:54,728 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:43:54,729 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:43:54,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,740 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,745 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:43:54,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,747 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:43:54,747 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:43:54,748 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:43:54,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,761 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,766 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:43:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,767 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:43:54,768 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:43:54,769 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:43:54,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,779 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,784 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:43:54,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,786 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:43:54,787 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:43:54,788 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:43:54,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,800 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,805 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:43:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,807 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:43:54,807 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:43:54,808 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:43:54,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,819 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:43:54,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,826 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:43:54,827 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:43:54,828 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:43:54,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,838 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,843 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:43:54,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,845 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:43:54,845 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:43:54,846 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:43:54,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,857 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,862 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:43:54,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,863 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:43:54,864 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:43:54,865 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:43:54,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,877 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,881 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:43:54,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,883 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:43:54,885 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:43:54,885 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:43:54,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,896 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,901 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:43:54,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,903 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:43:54,904 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:43:54,905 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:43:54,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,917 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 16:43:54,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,926 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:43:54,927 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:43:54,927 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:43:54,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,942 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,947 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:43:54,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,949 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:43:54,959 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:43:54,959 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:43:54,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:54,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:54,975 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,980 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:43:54,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:54,982 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:43:54,982 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:43:54,983 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:43:54,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:54,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:54,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:54,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:54,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:54,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:54,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:54,993 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:54,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 16:43:54,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:54,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,000 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:43:55,001 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:43:55,002 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:43:55,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,013 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 16:43:55,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,020 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:43:55,020 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:43:55,021 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:43:55,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,032 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,039 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:43:55,040 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:43:55,040 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:43:55,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,051 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 16:43:55,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,057 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:43:55,058 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:43:55,059 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:43:55,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,072 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,077 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:43:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,078 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:43:55,079 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:43:55,080 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:43:55,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,092 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-04-26 16:43:55,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,099 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:43:55,099 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:43:55,100 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:43:55,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,115 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:43:55,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,117 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:43:55,117 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:43:55,118 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:43:55,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,130 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,135 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:43:55,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,136 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:43:55,137 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:43:55,138 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:43:55,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,148 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,153 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:43:55,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,155 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:43:55,156 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:43:55,157 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:43:55,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,167 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-04-26 16:43:55,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,174 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:43:55,174 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:43:55,175 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:43:55,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,187 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,192 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:43:55,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,194 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:43:55,195 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:43:55,196 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:43:55,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,209 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,215 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:43:55,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,217 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:43:55,218 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:43:55,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:43:55,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,229 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-04-26 16:43:55,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,236 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:43:55,237 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:43:55,238 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:43:55,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,248 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,253 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:43:55,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,255 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:43:55,255 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:43:55,256 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:43:55,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,267 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,272 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:43:55,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,274 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:43:55,274 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:43:55,275 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:43:55,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:55,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:55,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:55,286 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,291 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:43:55,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,293 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:43:55,293 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:43:55,294 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:43:55,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,306 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 16:43:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,312 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:43:55,313 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:43:55,314 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:43:55,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,326 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-04-26 16:43:55,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,333 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:43:55,333 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:43:55,334 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:43:55,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,347 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,352 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:43:55,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,354 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:43:55,354 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:43:55,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:43:55,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,367 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,372 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:43:55,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,374 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:43:55,374 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:43:55,375 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:43:55,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,385 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:43:55,385 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:43:55,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,398 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:43:55,398 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:43:55,419 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:55,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,426 INFO L229 MonitoredProcess]: Starting monitored process 83 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:43:55,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-04-26 16:43:55,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:43:55,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,437 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:43:55,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,439 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:43:55,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,443 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:55,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,453 INFO L229 MonitoredProcess]: Starting monitored process 84 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:43:55,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-04-26 16:43:55,456 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:43:55,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,469 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:55,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,475 INFO L229 MonitoredProcess]: Starting monitored process 85 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:43:55,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-04-26 16:43:55,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:43:55,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,489 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,496 INFO L229 MonitoredProcess]: Starting monitored process 86 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:43:55,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-04-26 16:43:55,497 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:43:55,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,509 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-04-26 16:43:55,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,516 INFO L229 MonitoredProcess]: Starting monitored process 87 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:43:55,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-04-26 16:43:55,517 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:43:55,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:55,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-04-26 16:43:55,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,538 INFO L229 MonitoredProcess]: Starting monitored process 88 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:43:55,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-04-26 16:43:55,539 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:43:55,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:55,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:55,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:55,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:55,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:55,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:55,561 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:43:55,571 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:43:55,571 INFO L437 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-04-26 16:43:55,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:55,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:55,573 INFO L229 MonitoredProcess]: Starting monitored process 89 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:43:55,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-04-26 16:43:55,574 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:43:55,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-04-26 16:43:55,589 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:43:55,589 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:43:55,589 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1, ~M~0) = -1*thread2Thread1of1ForFork0_~i~1 + 1*~M~0 Supporting invariants [] [2025-04-26 16:43:55,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-04-26 16:43:55,634 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2025-04-26 16:43:55,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:55,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-26 16:43:55,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-26 16:43:55,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:55,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:55,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:43:55,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:55,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:55,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:55,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:55,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:43:55,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:55,795 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:43:55,795 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:43:55,796 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4002 states and 5931 transitions. cyclomatic complexity: 2131 Second operand has 5 states, 5 states have (on average 18.4) internal successors, (in total 92), 5 states have internal predecessors, (92), 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:43:55,889 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4002 states and 5931 transitions. cyclomatic complexity: 2131. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (in total 92), 5 states have internal predecessors, (92), 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 6924 states and 10504 transitions. Complement of second has 9 states. [2025-04-26 16:43:55,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:43:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (in total 92), 5 states have internal predecessors, (92), 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:43:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2025-04-26 16:43:55,890 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 223 transitions. Stem has 99 letters. Loop has 5 letters. [2025-04-26 16:43:55,891 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:55,891 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 223 transitions. Stem has 104 letters. Loop has 5 letters. [2025-04-26 16:43:55,891 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:55,891 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 223 transitions. Stem has 99 letters. Loop has 10 letters. [2025-04-26 16:43:55,891 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:55,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6924 states and 10504 transitions. [2025-04-26 16:43:55,913 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 75 [2025-04-26 16:43:55,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6924 states to 4083 states and 6026 transitions. [2025-04-26 16:43:55,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1440 [2025-04-26 16:43:55,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1570 [2025-04-26 16:43:55,934 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4083 states and 6026 transitions. [2025-04-26 16:43:55,934 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:55,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4083 states and 6026 transitions. [2025-04-26 16:43:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states and 6026 transitions. [2025-04-26 16:43:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 3675. [2025-04-26 16:43:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 3675 states have (on average 1.4829931972789117) internal successors, (in total 5450), 3674 states have internal predecessors, (5450), 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:43:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 5450 transitions. [2025-04-26 16:43:55,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3675 states and 5450 transitions. [2025-04-26 16:43:55,980 INFO L438 stractBuchiCegarLoop]: Abstraction has 3675 states and 5450 transitions. [2025-04-26 16:43:55,980 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:43:55,980 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3675 states and 5450 transitions. [2025-04-26 16:43:55,986 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 75 [2025-04-26 16:43:55,986 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:55,986 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:55,987 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, 1, 1, 1, 1, 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:43:55,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:55,987 INFO L752 eck$LassoCheckResult]: Stem: "[266] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[276] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[328] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[356] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[287] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[320] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[302] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[263] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[277] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[289] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[354] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[355] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[369] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[370] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[324] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[372] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[273] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[291] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[241] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[239] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[313] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[376] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[292] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[245] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[242] L87-2-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[250] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[357] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L106-1-->L36: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[366] L36-->L37: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[296] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[353] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[290] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[367] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[362] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[340] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[270] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[311] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[305] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[344] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[363] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[368] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[309] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[254] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[252] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[350] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[329] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[279] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[317] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[260] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[253] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[256] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[349] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[352] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[255] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[271] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[303] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[251] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[310] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[288] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[262] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[308] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[284] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[319] L89-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_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[300] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[418] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[377] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[378] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[380] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[382] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[384] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[386] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[387] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[379] L46-4-->L46-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork2_~i~0_3) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[381] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[383] L54-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset]" "[385] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[318] L92-4-->L92-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[330] L92-5-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1]" "[272] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[351] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[331] L93-2-->L93-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre15#1_3|) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[412] L93-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_8|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_4|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[388] $Ultimate##0-->L58: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" "[389] L58-->L58-4: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[390] L58-4-->L58-5: Formula: (<= v_~M~0_2 v_thread2Thread1of1ForFork0_~i~1_3) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_3, ~M~0=v_~M~0_2} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_3, ~M~0=v_~M~0_2} AuxVars[] AssignedVars[]" "[392] L58-5-->L66: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[394] L66-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_1|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base]" "[396] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[360] L93-4-->L93-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[257] L93-5-->L94: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1]" "[358] L94-->L94-1: Formula: (= |v_ULTIMATE.start_main_#t~pre17#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{#pthreadsForks=|v_#pthreadsForks_7|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre17#1]" "[314] L94-1-->L94-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks]" "[335] L94-2-->L94-3: Formula: (= |v_ULTIMATE.start_main_~t3~0#1_3| |v_ULTIMATE.start_main_#t~pre17#1_3|) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|} OutVars{ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[415] L94-3-->$Ultimate##0: Formula: (and (= |v_thread3Thread1of1ForFork1_#in~_argptr.base_4| 0) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_7|) (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= |v_thread3Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_7|} OutVars{thread3Thread1of1ForFork1_#in~_argptr.base=|v_thread3Thread1of1ForFork1_#in~_argptr.base_4|, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_4|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_16, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_~_argptr.base=v_thread3Thread1of1ForFork1_~_argptr.base_4, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_7|, thread3Thread1of1ForFork1_#t~mem7=|v_thread3Thread1of1ForFork1_#t~mem7_4|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2, thread3Thread1of1ForFork1_~_argptr.offset=v_thread3Thread1of1ForFork1_~_argptr.offset_4, thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_8|, thread3Thread1of1ForFork1_#in~_argptr.offset=|v_thread3Thread1of1ForFork1_#in~_argptr.offset_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#in~_argptr.base, thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~i~2, thread3Thread1of1ForFork1_#t~mem8, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_~_argptr.base, thread3Thread1of1ForFork1_#t~mem7, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2, thread3Thread1of1ForFork1_~_argptr.offset, thread3Thread1of1ForFork1_#t~post9, thread3Thread1of1ForFork1_#in~_argptr.offset]" "[399] $Ultimate##0-->L70: Formula: (and (= v_thread3Thread1of1ForFork1_~_argptr.offset_1 |v_thread3Thread1of1ForFork1_#in~_argptr.offset_1|) (= |v_thread3Thread1of1ForFork1_#in~_argptr.base_1| v_thread3Thread1of1ForFork1_~_argptr.base_1)) InVars {thread3Thread1of1ForFork1_#in~_argptr.base=|v_thread3Thread1of1ForFork1_#in~_argptr.base_1|, thread3Thread1of1ForFork1_#in~_argptr.offset=|v_thread3Thread1of1ForFork1_#in~_argptr.offset_1|} OutVars{thread3Thread1of1ForFork1_~_argptr.offset=v_thread3Thread1of1ForFork1_~_argptr.offset_1, thread3Thread1of1ForFork1_#in~_argptr.base=|v_thread3Thread1of1ForFork1_#in~_argptr.base_1|, thread3Thread1of1ForFork1_#in~_argptr.offset=|v_thread3Thread1of1ForFork1_#in~_argptr.offset_1|, thread3Thread1of1ForFork1_~_argptr.base=v_thread3Thread1of1ForFork1_~_argptr.base_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~_argptr.offset, thread3Thread1of1ForFork1_~_argptr.base]" "[400] L70-->L70-4: Formula: (= v_thread3Thread1of1ForFork1_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2]" [2025-04-26 16:43:55,987 INFO L754 eck$LassoCheckResult]: Loop: "[402] L70-4-->L71: Formula: (< v_thread3Thread1of1ForFork1_~i~2_5 v_~N~0_4) InVars {thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_5, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_5, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[404] L71-->L75: Formula: (let ((.cse5 (* v_thread3Thread1of1ForFork1_~i~2_9 4))) (let ((.cse4 (+ v_~A~0.offset_45 .cse5))) (let ((.cse1 (<= 0 .cse4)) (.cse2 (<= (+ v_~A~0.offset_45 4 .cse5) (select |v_#length_48| v_~A~0.base_45))) (.cse3 (= (select |v_#valid_49| v_~A~0.base_45) 1))) (and (let ((.cse0 (select (select |v_#memory_int_47| v_~A~0.base_45) .cse4))) (or (and (<= .cse0 v_~max3~0_21) (= |v_thread3Thread1of1ForFork1_#t~mem8_2| |v_thread3Thread1of1ForFork1_#t~mem8_1|) (= v_~max3~0_21 v_~max3~0_20)) (and (= v_~max3~0_20 .cse0) (< v_~max3~0_21 .cse0) .cse1 .cse2 .cse3))) .cse1 .cse2 .cse3)))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~max3~0=v_~max3~0_21, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_47|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, #length=|v_#length_48|} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~max3~0=v_~max3~0_20, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_47|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_2|, #length=|v_#length_48|, thread3Thread1of1ForFork1_#t~mem7=|v_thread3Thread1of1ForFork1_#t~mem7_1|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork1_#t~mem8, thread3Thread1of1ForFork1_#t~mem7]" "[406] L75-->L70-2: Formula: (= v_thread3Thread1of1ForFork1_~i~2_11 |v_thread3Thread1of1ForFork1_#t~post9_1|) InVars {thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_11} OutVars{thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_11} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9]" "[408] L70-2-->L70-3: Formula: (= v_thread3Thread1of1ForFork1_~i~2_13 (+ |v_thread3Thread1of1ForFork1_#t~post9_3| 1)) InVars {thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_3|} OutVars{thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_3|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_13} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2]" "[409] L70-3-->L70-4: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9]" [2025-04-26 16:43:55,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1040258583, now seen corresponding path program 1 times [2025-04-26 16:43:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:55,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852318659] [2025-04-26 16:43:55,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:55,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-26 16:43:55,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-26 16:43:55,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:55,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:55,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:56,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-26 16:43:56,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-26 16:43:56,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:56,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:56,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:56,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash 412323380, now seen corresponding path program 1 times [2025-04-26 16:43:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:56,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333314694] [2025-04-26 16:43:56,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:56,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:56,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:56,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:56,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:56,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:56,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:56,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:56,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:56,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:56,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:56,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:56,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:56,018 INFO L85 PathProgramCache]: Analyzing trace with hash 174232908, now seen corresponding path program 1 times [2025-04-26 16:43:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:56,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589185863] [2025-04-26 16:43:56,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:56,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-26 16:43:56,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-26 16:43:56,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:56,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:56,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:56,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-26 16:43:56,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-26 16:43:56,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:56,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:56,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:57,278 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:43:57,279 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:43:57,279 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:43:57,279 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:43:57,279 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:43:57,279 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:57,279 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:43:57,279 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:43:57,279 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array-hom.wvr.c_petrified1_Iteration8_Lasso [2025-04-26 16:43:57,279 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:43:57,279 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:43:57,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:58,175 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:43:58,176 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:43:58,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,178 INFO L229 MonitoredProcess]: Starting monitored process 90 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:43:58,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-04-26 16:43:58,179 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:43:58,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,192 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-04-26 16:43:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,199 INFO L229 MonitoredProcess]: Starting monitored process 91 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:43:58,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-04-26 16:43:58,201 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:43:58,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,212 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-04-26 16:43:58,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,219 INFO L229 MonitoredProcess]: Starting monitored process 92 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:43:58,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-04-26 16:43:58,221 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:43:58,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-04-26 16:43:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,238 INFO L229 MonitoredProcess]: Starting monitored process 93 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:43:58,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-04-26 16:43:58,240 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:43:58,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,252 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-04-26 16:43:58,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,259 INFO L229 MonitoredProcess]: Starting monitored process 94 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:43:58,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-04-26 16:43:58,260 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:43:58,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,273 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,280 INFO L229 MonitoredProcess]: Starting monitored process 95 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:43:58,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-04-26 16:43:58,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:43:58,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,294 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-04-26 16:43:58,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,301 INFO L229 MonitoredProcess]: Starting monitored process 96 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:43:58,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-04-26 16:43:58,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:43:58,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,314 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,321 INFO L229 MonitoredProcess]: Starting monitored process 97 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:43:58,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-04-26 16:43:58,322 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:43:58,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,333 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,340 INFO L229 MonitoredProcess]: Starting monitored process 98 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:43:58,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-04-26 16:43:58,341 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:43:58,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,352 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-04-26 16:43:58,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,358 INFO L229 MonitoredProcess]: Starting monitored process 99 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:43:58,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-04-26 16:43:58,361 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:43:58,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-04-26 16:43:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,380 INFO L229 MonitoredProcess]: Starting monitored process 100 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:43:58,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-04-26 16:43:58,381 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:43:58,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,392 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-04-26 16:43:58,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,399 INFO L229 MonitoredProcess]: Starting monitored process 101 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:43:58,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-04-26 16:43:58,401 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:43:58,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,411 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-04-26 16:43:58,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,418 INFO L229 MonitoredProcess]: Starting monitored process 102 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:43:58,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-04-26 16:43:58,420 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:43:58,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,431 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,439 INFO L229 MonitoredProcess]: Starting monitored process 103 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:43:58,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-04-26 16:43:58,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:43:58,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,451 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,458 INFO L229 MonitoredProcess]: Starting monitored process 104 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:43:58,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-04-26 16:43:58,460 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:43:58,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,479 INFO L229 MonitoredProcess]: Starting monitored process 105 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:43:58,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-04-26 16:43:58,480 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:43:58,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,491 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-04-26 16:43:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,497 INFO L229 MonitoredProcess]: Starting monitored process 106 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:43:58,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-04-26 16:43:58,499 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:43:58,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,509 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,515 INFO L229 MonitoredProcess]: Starting monitored process 107 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:43:58,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-04-26 16:43:58,517 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:43:58,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,529 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,536 INFO L229 MonitoredProcess]: Starting monitored process 108 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:43:58,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-04-26 16:43:58,537 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:43:58,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,550 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,556 INFO L229 MonitoredProcess]: Starting monitored process 109 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:43:58,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-04-26 16:43:58,558 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:43:58,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,570 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,577 INFO L229 MonitoredProcess]: Starting monitored process 110 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:43:58,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-04-26 16:43:58,579 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:43:58,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,589 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-04-26 16:43:58,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,596 INFO L229 MonitoredProcess]: Starting monitored process 111 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:43:58,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-04-26 16:43:58,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:43:58,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,609 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-04-26 16:43:58,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,616 INFO L229 MonitoredProcess]: Starting monitored process 112 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:43:58,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-04-26 16:43:58,618 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:43:58,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,630 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,637 INFO L229 MonitoredProcess]: Starting monitored process 113 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:43:58,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-04-26 16:43:58,647 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:43:58,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,659 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-04-26 16:43:58,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,666 INFO L229 MonitoredProcess]: Starting monitored process 114 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:43:58,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-04-26 16:43:58,668 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:43:58,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,679 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,685 INFO L229 MonitoredProcess]: Starting monitored process 115 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:43:58,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-04-26 16:43:58,687 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:43:58,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,698 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-04-26 16:43:58,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,705 INFO L229 MonitoredProcess]: Starting monitored process 116 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:43:58,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-04-26 16:43:58,707 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:43:58,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,717 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-04-26 16:43:58,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,724 INFO L229 MonitoredProcess]: Starting monitored process 117 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:43:58,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-04-26 16:43:58,725 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:43:58,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,737 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-04-26 16:43:58,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,744 INFO L229 MonitoredProcess]: Starting monitored process 118 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:43:58,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-04-26 16:43:58,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:43:58,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,758 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-04-26 16:43:58,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,765 INFO L229 MonitoredProcess]: Starting monitored process 119 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:43:58,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-04-26 16:43:58,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:43:58,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,776 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,783 INFO L229 MonitoredProcess]: Starting monitored process 120 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:43:58,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-04-26 16:43:58,784 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:43:58,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,795 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-04-26 16:43:58,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,802 INFO L229 MonitoredProcess]: Starting monitored process 121 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:43:58,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-04-26 16:43:58,804 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:43:58,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,814 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-04-26 16:43:58,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,821 INFO L229 MonitoredProcess]: Starting monitored process 122 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:43:58,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-04-26 16:43:58,822 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:43:58,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,834 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-04-26 16:43:58,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,841 INFO L229 MonitoredProcess]: Starting monitored process 123 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:43:58,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-04-26 16:43:58,842 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:43:58,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,854 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,861 INFO L229 MonitoredProcess]: Starting monitored process 124 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:43:58,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-04-26 16:43:58,863 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:43:58,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,873 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-04-26 16:43:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,880 INFO L229 MonitoredProcess]: Starting monitored process 125 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:43:58,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-04-26 16:43:58,883 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:43:58,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,893 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,900 INFO L229 MonitoredProcess]: Starting monitored process 126 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:43:58,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-04-26 16:43:58,902 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:43:58,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,914 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-04-26 16:43:58,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,920 INFO L229 MonitoredProcess]: Starting monitored process 127 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:43:58,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-04-26 16:43:58,922 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:43:58,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,932 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,939 INFO L229 MonitoredProcess]: Starting monitored process 128 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:43:58,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-04-26 16:43:58,941 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:43:58,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:58,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:58,953 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-04-26 16:43:58,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,960 INFO L229 MonitoredProcess]: Starting monitored process 129 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:43:58,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-04-26 16:43:58,962 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:43:58,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,972 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-04-26 16:43:58,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,979 INFO L229 MonitoredProcess]: Starting monitored process 130 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:43:58,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-04-26 16:43:58,980 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:43:58,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:58,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:58,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:58,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:58,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:58,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:58,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:58,991 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:58,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-04-26 16:43:58,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:58,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:58,998 INFO L229 MonitoredProcess]: Starting monitored process 131 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:43:59,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-04-26 16:43:59,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:43:59,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:59,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:59,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:59,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:59,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:59,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:59,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:59,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:59,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:59,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:59,019 INFO L229 MonitoredProcess]: Starting monitored process 132 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:43:59,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-04-26 16:43:59,021 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:43:59,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:59,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:59,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:59,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:59,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:59,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:59,033 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:59,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:59,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:59,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:59,039 INFO L229 MonitoredProcess]: Starting monitored process 133 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:43:59,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-04-26 16:43:59,041 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:43:59,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:59,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:59,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:59,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:59,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:59,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:59,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:59,051 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:59,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:59,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:59,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:59,059 INFO L229 MonitoredProcess]: Starting monitored process 134 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:43:59,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-04-26 16:43:59,060 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:43:59,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:59,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:59,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:59,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:59,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:59,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:59,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:59,071 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:59,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-04-26 16:43:59,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:59,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:59,078 INFO L229 MonitoredProcess]: Starting monitored process 135 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:43:59,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-04-26 16:43:59,080 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:43:59,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:59,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:59,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:59,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:59,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:59,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:59,092 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:59,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-04-26 16:43:59,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:59,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:59,098 INFO L229 MonitoredProcess]: Starting monitored process 136 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:43:59,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-04-26 16:43:59,100 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:43:59,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:59,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:59,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:59,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:59,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:59,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:59,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:43:59,130 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:43:59,130 INFO L437 ModelExtractionUtils]: 0 out of 22 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-04-26 16:43:59,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:59,132 INFO L229 MonitoredProcess]: Starting monitored process 137 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:43:59,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-04-26 16:43:59,134 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:43:59,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:59,150 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:43:59,150 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:43:59,150 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread3Thread1of1ForFork1_~i~2) = 1*~N~0 - 1*thread3Thread1of1ForFork1_~i~2 Supporting invariants [] [2025-04-26 16:43:59,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-04-26 16:43:59,185 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2025-04-26 16:43:59,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:59,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-26 16:43:59,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-26 16:43:59,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:59,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:43:59,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:59,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:59,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:59,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:59,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:59,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:43:59,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:59,331 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:43:59,331 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:43:59,331 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3675 states and 5450 transitions. cyclomatic complexity: 1937 Second operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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:43:59,416 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3675 states and 5450 transitions. cyclomatic complexity: 1937. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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 6320 states and 9511 transitions. Complement of second has 8 states. [2025-04-26 16:43:59,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:43:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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:43:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2025-04-26 16:43:59,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 196 transitions. Stem has 99 letters. Loop has 5 letters. [2025-04-26 16:43:59,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:59,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 196 transitions. Stem has 104 letters. Loop has 5 letters. [2025-04-26 16:43:59,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:59,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 196 transitions. Stem has 99 letters. Loop has 10 letters. [2025-04-26 16:43:59,421 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:59,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6320 states and 9511 transitions. [2025-04-26 16:43:59,437 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:43:59,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6320 states to 0 states and 0 transitions. [2025-04-26 16:43:59,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:43:59,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:43:59,437 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:43:59,437 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:43:59,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:43:59,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:43:59,437 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:43:59,437 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:43:59,437 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:43:59,437 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:43:59,437 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:43:59,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:43:59,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:43:59 BoogieIcfgContainer [2025-04-26 16:43:59,449 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:43:59,450 INFO L158 Benchmark]: Toolchain (without parser) took 18284.15ms. Allocated memory was 155.2MB in the beginning and 528.5MB in the end (delta: 373.3MB). Free memory was 107.2MB in the beginning and 325.4MB in the end (delta: -218.2MB). Peak memory consumption was 152.5MB. Max. memory is 8.0GB. [2025-04-26 16:43:59,450 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:43:59,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.52ms. Allocated memory is still 155.2MB. Free memory was 107.2MB in the beginning and 92.4MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:43:59,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.27ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 90.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:43:59,451 INFO L158 Benchmark]: Boogie Preprocessor took 36.54ms. Allocated memory is still 155.2MB. Free memory was 90.8MB in the beginning and 89.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:43:59,451 INFO L158 Benchmark]: RCFGBuilder took 381.79ms. Allocated memory is still 155.2MB. Free memory was 89.5MB in the beginning and 65.6MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-26 16:43:59,451 INFO L158 Benchmark]: BuchiAutomizer took 17604.41ms. Allocated memory was 155.2MB in the beginning and 528.5MB in the end (delta: 373.3MB). Free memory was 65.6MB in the beginning and 325.4MB in the end (delta: -259.8MB). Peak memory consumption was 110.6MB. Max. memory is 8.0GB. [2025-04-26 16:43:59,453 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.67ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.52ms. Allocated memory is still 155.2MB. Free memory was 107.2MB in the beginning and 92.4MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.27ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 90.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.54ms. Allocated memory is still 155.2MB. Free memory was 90.8MB in the beginning and 89.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 381.79ms. Allocated memory is still 155.2MB. Free memory was 89.5MB in the beginning and 65.6MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 17604.41ms. Allocated memory was 155.2MB in the beginning and 528.5MB in the end (delta: 373.3MB). Free memory was 65.6MB in the beginning and 325.4MB in the end (delta: -259.8MB). Peak memory consumption was 110.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 17.5s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 13.1s. Construction of modules took 0.6s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 2539 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2112 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2109 mSDsluCounter, 5305 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4304 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1580 IncrementalHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 1001 mSDtfsCounter, 1580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital276 mio100 ax119 hnf100 lsp127 ukn55 mio100 lsp39 div156 bol100 ite100 ukn100 eq151 hnf93 smp79 dnf238 smp69 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 7 VariablesLoop: 9 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 627, Number of transitions in reduction automaton: 5041, Number of states in reduction automaton: 3456, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (size + ((long long) -1 * i)) and consists of 6 locations. One deterministic module has affine ranking function null and consists of 13 locations. One deterministic module has affine ranking function (M + ((long long) -1 * i)) and consists of 5 locations. One deterministic module has affine ranking function (((long long) -1 * i) + N) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 31 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:43:59,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-26 16:43:59,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:59,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:00,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...