/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.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:43:38,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:43:38,913 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,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:43:38,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:43:38,919 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,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:43:38,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:43:38,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:43:38,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:43:38,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:43:38,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:43:38,940 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:43:38,940 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:43:38,940 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:43:38,940 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:43:38,940 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:43:38,940 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:43:38,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:43:38,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:43:38,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:43:38,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:43:38,942 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:43:38,942 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:43:39,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:43:39,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:43:39,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:43:39,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:43:39,177 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:43:39,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2025-04-26 16:43:40,475 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/52cf0ceb3/66aacc1626b44db9b6741d8b4a3cb83b/FLAG22546bce1 [2025-04-26 16:43:40,642 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:43:40,643 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2025-04-26 16:43:40,648 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/52cf0ceb3/66aacc1626b44db9b6741d8b4a3cb83b/FLAG22546bce1 [2025-04-26 16:43:41,476 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/52cf0ceb3/66aacc1626b44db9b6741d8b4a3cb83b [2025-04-26 16:43:41,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:43:41,479 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:43:41,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:43:41,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:43:41,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:43:41,483 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,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672c34b6 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,483 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,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:43:41,660 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.wvr.c[2592,2605] [2025-04-26 16:43:41,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:43:41,680 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:43:41,717 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.wvr.c[2592,2605] [2025-04-26 16:43:41,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:43:41,735 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:43:41,735 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,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:43:41,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:43:41,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:43:41,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:43:41,741 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,749 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,768 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2025-04-26 16:43:41,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:43:41,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:43:41,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:43:41,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:43:41,775 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,775 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,780 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,781 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,792 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,792 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,798 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,798 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,799 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,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:43:41,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:43:41,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:43:41,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:43:41,807 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,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:43:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:41,832 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,834 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,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:43:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:43:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:43:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 16:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-26 16:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-26 16:43:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 16:43:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:43:41,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:43:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 16:43:41,851 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,929 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:43:41,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:43:42,132 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:43:42,132 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:43:42,211 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:43:42,212 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:43:42,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:43:42 BoogieIcfgContainer [2025-04-26 16:43:42,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:43:42,213 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:43:42,213 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:43:42,220 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:43:42,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:43:42,221 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:42,221 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cb0230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:43:42, skipping insertion in model container [2025-04-26 16:43:42,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:43:42,222 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:42,222 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cb0230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:43:42, skipping insertion in model container [2025-04-26 16:43:42,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:43:42,222 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:43:42" (3/3) ... [2025-04-26 16:43:42,223 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2025-04-26 16:43:42,284 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:43:42,315 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:43:42,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:43:42,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:42,319 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:42,320 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,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 143 transitions, 307 flow [2025-04-26 16:43:42,409 INFO L116 PetriNetUnfolderBase]: 8/137 cut-off events. [2025-04-26 16:43:42,411 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:43:42,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 8/137 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/128 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2025-04-26 16:43:42,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 143 transitions, 307 flow [2025-04-26 16:43:42,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 137 transitions, 292 flow [2025-04-26 16:43:42,424 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 139 places, 137 transitions, 292 flow [2025-04-26 16:43:42,428 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:43:42,564 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 799#[L94-5, L71, thread1EXIT, L59]true [2025-04-26 16:43:42,973 WARN L140 AmpleReduction]: Number of pruned transitions: 6777 [2025-04-26 16:43:42,973 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:43:42,973 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 409 [2025-04-26 16:43:42,973 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:130 [2025-04-26 16:43:42,973 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:2789 [2025-04-26 16:43:42,973 WARN L145 AmpleReduction]: Times succ was already a loop node:78 [2025-04-26 16:43:42,974 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:714 [2025-04-26 16:43:42,974 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:43:42,987 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3328 states, 3326 states have (on average 1.4428743235117258) internal successors, (in total 4799), 3327 states have internal predecessors, (4799), 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,994 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:43:42,994 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:43:42,994 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:43:42,994 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:43:42,994 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:43:42,995 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:43:42,995 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:43:42,995 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:43:43,002 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3328 states, 3326 states have (on average 1.4428743235117258) internal successors, (in total 4799), 3327 states have internal predecessors, (4799), 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:43,091 INFO L131 ngComponentsAnalysis]: Automaton has 203 accepting balls. 2112 [2025-04-26 16:43:43,092 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:43,092 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:43,097 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] [2025-04-26 16:43:43,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:43:43,097 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:43:43,101 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3328 states, 3326 states have (on average 1.4428743235117258) internal successors, (in total 4799), 3327 states have internal predecessors, (4799), 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:43,138 INFO L131 ngComponentsAnalysis]: Automaton has 203 accepting balls. 2112 [2025-04-26 16:43:43,139 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:43,139 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:43,140 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] [2025-04-26 16:43:43,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:43:43,145 INFO L752 eck$LassoCheckResult]: Stem: "[265] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[275] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[327] 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[]" "[354] 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[]" "[286] 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[]" "[319] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 28)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[301] 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]" "[262] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[276] L41-1-->L41-2: Formula: (= v_~max2~0_7 0) InVars {} OutVars{~max2~0=v_~max2~0_7} AuxVars[] AssignedVars[~max2~0]" "[288] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[353] L41-3-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[368] 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]" "[323] 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]" "[245] 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]" "[370] 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]" "[272] 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]" "[290] 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]" "[240] 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]" "[238] 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]" "[312] 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]" "[374] 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]" "[291] 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]" "[244] 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]" "[241] 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]" "[249] 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]" "[355] 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]" "[347] 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]" "[364] 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]" "[295] 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[]" "[352] 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]" "[289] 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]" "[365] 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]" "[360] 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]" "[339] 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]" "[269] 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[]" "[310] 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]" "[304] 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]" "[343] 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]" "[361] 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]" "[366] 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]" "[308] 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:43,147 INFO L754 eck$LassoCheckResult]: Loop: "[253] 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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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:43,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash 521739276, now seen corresponding path program 1 times [2025-04-26 16:43:43,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:43,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365619289] [2025-04-26 16:43:43,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:43,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:43:43,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:43:43,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:43,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:43,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:43:43,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:43:43,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:43,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:43,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:43,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1871282035, now seen corresponding path program 1 times [2025-04-26 16:43:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:43,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533402970] [2025-04-26 16:43:43,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:43,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:43:43,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:43:43,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:43,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:43,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:43,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:43:43,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:43:43,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:43,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:43,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:43,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash -370814712, now seen corresponding path program 1 times [2025-04-26 16:43:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:43,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589300159] [2025-04-26 16:43:43,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:43,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-26 16:43:43,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 16:43:43,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:43,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:43,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-26 16:43:43,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 16:43:43,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:43,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:43,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:43,732 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:43:43,732 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:43:43,732 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:43:43,732 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:43:43,732 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:43:43,732 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:43,732 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:43:43,733 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:43:43,733 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array.wvr.c_petrified1_Iteration1_Lasso [2025-04-26 16:43:43,733 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:43:43,733 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:43:43,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:43,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:44,351 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:43:44,353 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:43:44,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,356 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:44,358 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:44,359 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,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,375 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,381 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,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,383 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,385 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,386 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,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:44,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:44,400 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:44,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,408 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,410 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,411 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,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,423 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,429 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,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,431 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,432 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,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:43:44,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,446 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,451 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,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,454 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,455 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,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:44,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:44,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,480 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,481 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,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:43:44,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,495 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:44,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,502 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,504 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,505 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,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:44,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:44,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:44,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,530 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,531 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,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:43:44,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:44,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:44,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:44,549 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:44,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:44,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,557 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,558 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,560 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,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:44,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:44,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:44,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:44,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:44,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:44,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:43:44,626 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 16:43:44,627 INFO L437 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:43:44,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:44,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:44,631 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,632 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,632 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:43:44,652 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,652 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:43:44,653 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:43:44,653 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,660 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,672 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:43:44,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:44,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:43:44,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:43:44,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:44,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:44,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:43:44,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:44,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:43:44,792 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,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:44,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:44,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:43:44,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:44,859 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,874 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,879 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 3328 states, 3326 states have (on average 1.4428743235117258) internal successors, (in total 4799), 3327 states have internal predecessors, (4799), 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 9.8) internal successors, (in total 49), 5 states have internal predecessors, (49), 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,035 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 3328 states, 3326 states have (on average 1.4428743235117258) internal successors, (in total 4799), 3327 states have internal predecessors, (4799), 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 9.8) internal successors, (in total 49), 5 states have internal predecessors, (49), 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 6636 states and 9580 transitions. Complement of second has 10 states. [2025-04-26 16:43:45,036 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:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (in total 49), 5 states have internal predecessors, (49), 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,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2025-04-26 16:43:45,045 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 161 transitions. Stem has 42 letters. Loop has 7 letters. [2025-04-26 16:43:45,046 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:45,046 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 161 transitions. Stem has 49 letters. Loop has 7 letters. [2025-04-26 16:43:45,046 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:45,047 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 161 transitions. Stem has 42 letters. Loop has 14 letters. [2025-04-26 16:43:45,048 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:45,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6636 states and 9580 transitions. [2025-04-26 16:43:45,093 INFO L131 ngComponentsAnalysis]: Automaton has 202 accepting balls. 2105 [2025-04-26 16:43:45,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6636 states to 3103 states and 4482 transitions. [2025-04-26 16:43:45,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3094 [2025-04-26 16:43:45,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3096 [2025-04-26 16:43:45,122 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3103 states and 4482 transitions. [2025-04-26 16:43:45,133 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:45,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3103 states and 4482 transitions. [2025-04-26 16:43:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states and 4482 transitions. [2025-04-26 16:43:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3102. [2025-04-26 16:43:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3102 states, 3102 states have (on average 1.4445519019987105) internal successors, (in total 4481), 3101 states have internal predecessors, (4481), 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,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4481 transitions. [2025-04-26 16:43:45,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3102 states and 4481 transitions. [2025-04-26 16:43:45,245 INFO L438 stractBuchiCegarLoop]: Abstraction has 3102 states and 4481 transitions. [2025-04-26 16:43:45,245 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:43:45,245 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3102 states and 4481 transitions. [2025-04-26 16:43:45,256 INFO L131 ngComponentsAnalysis]: Automaton has 202 accepting balls. 2105 [2025-04-26 16:43:45,256 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:45,257 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:45,258 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] [2025-04-26 16:43:45,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:45,259 INFO L752 eck$LassoCheckResult]: Stem: "[265] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[275] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[327] 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[]" "[354] 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[]" "[286] 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[]" "[319] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 28)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[301] 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]" "[262] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[276] L41-1-->L41-2: Formula: (= v_~max2~0_7 0) InVars {} OutVars{~max2~0=v_~max2~0_7} AuxVars[] AssignedVars[~max2~0]" "[288] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[353] L41-3-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[368] 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]" "[323] 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]" "[245] 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]" "[370] 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]" "[272] 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]" "[290] 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]" "[240] 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]" "[238] 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]" "[312] 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]" "[374] 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]" "[291] 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]" "[244] 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]" "[241] 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]" "[249] 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]" "[355] 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]" "[347] 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]" "[364] 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]" "[295] 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[]" "[352] 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]" "[289] 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]" "[365] 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]" "[360] 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]" "[339] 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]" "[269] 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[]" "[310] 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]" "[304] 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]" "[343] 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]" "[361] 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]" "[366] 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]" "[308] 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]" "[252] 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[]" "[255] 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]" "[348] 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]" "[351] 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]" "[254] 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]" "[270] 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]" "[302] 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]" "[250] 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]" "[309] 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]" "[287] 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]" "[261] 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]" "[307] 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[]" "[283] 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]" "[318] 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]" "[345] 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]" "[333] 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]" "[299] 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]" "[416] 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]" "[375] $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]" "[376] 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,259 INFO L754 eck$LassoCheckResult]: Loop: "[378] 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[]" "[380] 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]" "[382] 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]" "[384] 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]" "[385] 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,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1948283309, now seen corresponding path program 1 times [2025-04-26 16:43:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:45,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339151757] [2025-04-26 16:43:45,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:45,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:45,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-26 16:43:45,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-26 16:43:45,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:45,554 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,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:43:45,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339151757] [2025-04-26 16:43:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339151757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:43:45,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:43:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-26 16:43:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889634196] [2025-04-26 16:43:45,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:43:45,557 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:43:45,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 389420060, now seen corresponding path program 1 times [2025-04-26 16:43:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:45,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494220532] [2025-04-26 16:43:45,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:45,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:45,566 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,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:45,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:45,570 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,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:43:45,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:43:45,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:43:45,668 INFO L87 Difference]: Start difference. First operand 3102 states and 4481 transitions. cyclomatic complexity: 1582 Second operand has 8 states, 8 states have (on average 7.75) internal successors, (in total 62), 8 states have internal predecessors, (62), 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,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:43:45,848 INFO L93 Difference]: Finished difference Result 3119 states and 4496 transitions. [2025-04-26 16:43:45,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3119 states and 4496 transitions. [2025-04-26 16:43:45,867 INFO L131 ngComponentsAnalysis]: Automaton has 202 accepting balls. 2105 [2025-04-26 16:43:45,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3119 states to 3106 states and 4483 transitions. [2025-04-26 16:43:45,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3094 [2025-04-26 16:43:45,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3094 [2025-04-26 16:43:45,895 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3106 states and 4483 transitions. [2025-04-26 16:43:45,897 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:45,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3106 states and 4483 transitions. [2025-04-26 16:43:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states and 4483 transitions. [2025-04-26 16:43:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3101. [2025-04-26 16:43:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 3101 states have (on average 1.4440503063527894) internal successors, (in total 4478), 3100 states have internal predecessors, (4478), 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,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 4478 transitions. [2025-04-26 16:43:45,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3101 states and 4478 transitions. [2025-04-26 16:43:45,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:43:45,960 INFO L438 stractBuchiCegarLoop]: Abstraction has 3101 states and 4478 transitions. [2025-04-26 16:43:45,960 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:43:45,961 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3101 states and 4478 transitions. [2025-04-26 16:43:45,971 INFO L131 ngComponentsAnalysis]: Automaton has 202 accepting balls. 2105 [2025-04-26 16:43:45,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:45,971 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:45,972 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] [2025-04-26 16:43:45,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:45,974 INFO L752 eck$LassoCheckResult]: Stem: "[265] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[275] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[327] 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[]" "[354] 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[]" "[286] 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[]" "[319] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 28)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[301] 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]" "[262] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[276] L41-1-->L41-2: Formula: (= v_~max2~0_7 0) InVars {} OutVars{~max2~0=v_~max2~0_7} AuxVars[] AssignedVars[~max2~0]" "[288] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[353] L41-3-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[368] 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]" "[323] 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]" "[245] 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]" "[370] 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]" "[272] 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]" "[290] 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]" "[240] 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]" "[238] 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]" "[312] 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]" "[374] 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]" "[291] 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]" "[244] 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]" "[241] 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]" "[249] 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]" "[355] 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]" "[347] 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]" "[364] 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]" "[295] 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[]" "[352] 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]" "[289] 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]" "[365] 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]" "[360] 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]" "[339] 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]" "[269] 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[]" "[310] 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]" "[304] 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]" "[343] 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]" "[361] 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]" "[366] 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]" "[308] 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-->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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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]" "[252] 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[]" "[255] 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]" "[348] 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]" "[351] 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]" "[254] 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]" "[270] 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]" "[302] 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]" "[250] 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]" "[309] 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]" "[287] 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]" "[261] 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]" "[307] 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[]" "[283] 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]" "[318] 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]" "[345] 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]" "[333] 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]" "[299] 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]" "[416] 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]" "[375] $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]" "[376] 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,974 INFO L754 eck$LassoCheckResult]: Loop: "[378] 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[]" "[380] 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]" "[382] 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]" "[384] 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]" "[385] 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,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash -337908401, now seen corresponding path program 1 times [2025-04-26 16:43:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:45,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272888425] [2025-04-26 16:43:45,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:45,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-26 16:43:45,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 16:43:45,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:45,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:45,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-26 16:43:45,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 16:43:45,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:45,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:46,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:46,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash 389420060, now seen corresponding path program 2 times [2025-04-26 16:43:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:46,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446008988] [2025-04-26 16:43:46,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:46,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:46,013 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:46,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:43:46,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:46,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:46,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:46,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:46,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:46,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:46,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:46,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1306544014, now seen corresponding path program 1 times [2025-04-26 16:43:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:46,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10989935] [2025-04-26 16:43:46,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:46,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-26 16:43:46,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-26 16:43:46,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:46,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:46,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-26 16:43:46,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-26 16:43:46,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:46,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:46,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:46,754 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:43:46,754 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:43:46,754 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:43:46,754 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:43:46,754 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:43:46,754 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:46,754 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:43:46,754 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:43:46,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array.wvr.c_petrified1_Iteration3_Lasso [2025-04-26 16:43:46,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:43:46,754 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:43:46,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:46,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:47,465 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:43:47,465 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:43:47,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,467 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,469 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,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:47,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,486 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,491 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,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,493 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,494 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,495 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,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,506 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,511 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,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,513 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,513 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,514 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,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,526 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,531 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,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,533 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,534 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,536 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,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,546 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,553 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,554 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,555 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,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,565 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,570 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,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,572 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,573 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,574 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,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,585 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,590 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,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,592 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,593 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,593 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,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:43:47,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,611 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,622 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,624 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,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,636 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,641 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,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,642 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,643 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,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:43:47,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,656 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,663 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,664 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,664 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,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,677 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,682 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,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,684 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,685 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,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:43:47,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:43:47,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:43:47,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:43:47,696 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,702 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,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,704 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,705 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,706 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,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,719 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:43:47,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,725 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,726 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,727 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,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,740 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,745 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,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,747 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,747 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,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:47,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,762 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,769 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,770 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,771 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,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,784 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:43:47,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,791 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,791 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,793 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,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,808 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,813 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,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,815 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,816 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,817 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,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,829 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,836 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,837 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,838 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,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,848 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:43:47,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,850 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:43:47,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,854 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:43:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,860 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,861 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,862 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,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,875 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,880 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,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,882 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,883 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,884 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,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,898 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,904 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,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,906 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:43:47,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:43:47,909 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,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,919 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:43:47,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,925 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:43:47,925 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:43:47,935 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:47,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:47,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,942 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:43:47,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:43:47,945 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,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:47,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:47,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:47,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:47,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:47,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:47,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:43:47,996 INFO L436 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2025-04-26 16:43:47,996 INFO L437 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-04-26 16:43:47,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:47,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:47,998 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:43:47,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:43:48,000 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:43:48,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:43:48,016 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:43:48,016 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:43:48,016 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread1Thread1of1ForFork2_~i~0) = 1*~N~0 - 1*thread1Thread1of1ForFork2_~i~0 Supporting invariants [] [2025-04-26 16:43:48,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:48,042 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-04-26 16:43:48,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:48,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-26 16:43:48,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 16:43:48,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:48,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:43:48,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:48,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:48,136 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,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:48,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:43:48,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:48,171 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,172 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:48,172 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3101 states and 4478 transitions. cyclomatic complexity: 1580 Second operand has 5 states, 5 states have (on average 14.8) internal successors, (in total 74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:43:48,277 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3101 states and 4478 transitions. cyclomatic complexity: 1580. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (in total 74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5196 states and 7629 transitions. Complement of second has 9 states. [2025-04-26 16:43:48,278 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:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (in total 74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:43:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2025-04-26 16:43:48,279 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 200 transitions. Stem has 69 letters. Loop has 5 letters. [2025-04-26 16:43:48,280 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:48,280 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 200 transitions. Stem has 74 letters. Loop has 5 letters. [2025-04-26 16:43:48,280 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:48,280 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 200 transitions. Stem has 69 letters. Loop has 10 letters. [2025-04-26 16:43:48,280 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:48,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5196 states and 7629 transitions. [2025-04-26 16:43:48,301 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 275 [2025-04-26 16:43:48,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5196 states to 3445 states and 5012 transitions. [2025-04-26 16:43:48,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1386 [2025-04-26 16:43:48,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1772 [2025-04-26 16:43:48,319 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3445 states and 5012 transitions. [2025-04-26 16:43:48,320 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:48,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3445 states and 5012 transitions. [2025-04-26 16:43:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states and 5012 transitions. [2025-04-26 16:43:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3315. [2025-04-26 16:43:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3315 states, 3315 states have (on average 1.4726998491704375) internal successors, (in total 4882), 3314 states have internal predecessors, (4882), 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,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4882 transitions. [2025-04-26 16:43:48,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3315 states and 4882 transitions. [2025-04-26 16:43:48,368 INFO L438 stractBuchiCegarLoop]: Abstraction has 3315 states and 4882 transitions. [2025-04-26 16:43:48,368 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:43:48,368 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3315 states and 4882 transitions. [2025-04-26 16:43:48,374 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 275 [2025-04-26 16:43:48,375 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:48,375 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:48,375 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] [2025-04-26 16:43:48,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:48,376 INFO L752 eck$LassoCheckResult]: Stem: "[265] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[275] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[327] 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[]" "[354] 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[]" "[286] 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[]" "[319] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 28)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[301] 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]" "[262] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[276] L41-1-->L41-2: Formula: (= v_~max2~0_7 0) InVars {} OutVars{~max2~0=v_~max2~0_7} AuxVars[] AssignedVars[~max2~0]" "[288] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[353] L41-3-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[368] 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]" "[323] 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]" "[245] 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]" "[370] 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]" "[272] 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]" "[290] 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]" "[240] 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]" "[238] 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]" "[312] 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]" "[374] 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]" "[291] 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]" "[244] 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]" "[241] 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]" "[249] 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]" "[355] 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]" "[347] 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]" "[364] 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]" "[295] 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[]" "[352] 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]" "[289] 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]" "[365] 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]" "[360] 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]" "[339] 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]" "[269] 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[]" "[310] 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]" "[304] 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]" "[343] 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]" "[361] 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]" "[366] 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]" "[308] 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-->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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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]" "[252] 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[]" "[255] 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]" "[348] 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]" "[351] 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]" "[254] 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]" "[270] 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]" "[302] 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]" "[250] 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]" "[309] 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]" "[287] 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]" "[261] 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]" "[307] 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[]" "[283] 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]" "[318] 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]" "[345] 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]" "[333] 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]" "[299] 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]" "[416] 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]" "[375] $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]" "[376] 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]" "[377] 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[]" "[379] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[381] 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]" "[383] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[317] 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]" "[329] 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]" "[271] 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]" "[350] 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]" "[330] 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]" "[410] 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]" "[386] $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]" "[387] 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,377 INFO L754 eck$LassoCheckResult]: Loop: "[389] 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[]" "[391] 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_38 .cse1) .cse0 .cse2 .cse3 (= v_~max2~0_37 .cse1)) (and (= v_~max2~0_38 v_~max2~0_37) (<= .cse1 v_~max2~0_38) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|)))) .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_38, #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_37, #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]" "[393] 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]" "[395] 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]" "[396] 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,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:48,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1984403393, now seen corresponding path program 1 times [2025-04-26 16:43:48,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:48,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866193941] [2025-04-26 16:43:48,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:48,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:48,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-26 16:43:48,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-26 16:43:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:48,536 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,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:43:48,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866193941] [2025-04-26 16:43:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866193941] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:43:48,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818873012] [2025-04-26 16:43:48,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:48,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:43:48,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:48,540 INFO L229 MonitoredProcess]: Starting monitored process 36 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,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-26 16:43:48,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-26 16:43:48,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-26 16:43:48,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:48,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:43:48,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:48,669 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,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:43:48,795 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,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818873012] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-26 16:43:48,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-26 16:43:48,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2025-04-26 16:43:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034685446] [2025-04-26 16:43:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:43:48,796 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:43:48,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 399917415, now seen corresponding path program 1 times [2025-04-26 16:43:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:48,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941149306] [2025-04-26 16:43:48,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:48,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:48,801 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,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:48,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:48,803 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,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:48,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:48,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:43:48,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:43:48,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-04-26 16:43:48,906 INFO L87 Difference]: Start difference. First operand 3315 states and 4882 transitions. cyclomatic complexity: 1722 Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (in total 81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:43:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:43:49,002 INFO L93 Difference]: Finished difference Result 3315 states and 4881 transitions. [2025-04-26 16:43:49,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3315 states and 4881 transitions. [2025-04-26 16:43:49,014 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 275 [2025-04-26 16:43:49,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3315 states to 3315 states and 4881 transitions. [2025-04-26 16:43:49,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1642 [2025-04-26 16:43:49,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1642 [2025-04-26 16:43:49,028 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3315 states and 4881 transitions. [2025-04-26 16:43:49,028 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:49,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3315 states and 4881 transitions. [2025-04-26 16:43:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states and 4881 transitions. [2025-04-26 16:43:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3315. [2025-04-26 16:43:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3315 states, 3315 states have (on average 1.472398190045249) internal successors, (in total 4881), 3314 states have internal predecessors, (4881), 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:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4881 transitions. [2025-04-26 16:43:49,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3315 states and 4881 transitions. [2025-04-26 16:43:49,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:43:49,076 INFO L438 stractBuchiCegarLoop]: Abstraction has 3315 states and 4881 transitions. [2025-04-26 16:43:49,076 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:43:49,076 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3315 states and 4881 transitions. [2025-04-26 16:43:49,082 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 275 [2025-04-26 16:43:49,082 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:49,083 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:49,083 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] [2025-04-26 16:43:49,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:49,084 INFO L752 eck$LassoCheckResult]: Stem: "[265] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[275] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[327] 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[]" "[354] 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[]" "[286] 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[]" "[319] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 28)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[301] 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]" "[262] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[276] L41-1-->L41-2: Formula: (= v_~max2~0_7 0) InVars {} OutVars{~max2~0=v_~max2~0_7} AuxVars[] AssignedVars[~max2~0]" "[288] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[353] L41-3-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[368] 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]" "[323] 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]" "[245] 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]" "[370] 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]" "[272] 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]" "[290] 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]" "[240] 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]" "[238] 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]" "[312] 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]" "[374] 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]" "[291] 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]" "[244] 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]" "[241] 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]" "[249] 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]" "[355] 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]" "[347] 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]" "[364] 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]" "[295] 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[]" "[352] 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]" "[289] 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]" "[365] 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]" "[360] 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]" "[339] 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]" "[269] 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[]" "[310] 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]" "[304] 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]" "[343] 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]" "[361] 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]" "[366] 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]" "[308] 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-->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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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]" "[252] 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[]" "[255] 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]" "[348] 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]" "[351] 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]" "[254] 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]" "[270] 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]" "[302] 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]" "[250] 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]" "[309] 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]" "[287] 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]" "[261] 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]" "[307] 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[]" "[283] 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]" "[318] 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]" "[345] 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]" "[333] 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]" "[299] 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]" "[416] 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]" "[375] $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]" "[376] 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]" "[378] 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[]" "[380] 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]" "[382] 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]" "[384] 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]" "[385] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[377] 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[]" "[379] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[381] 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]" "[383] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[317] 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]" "[329] 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]" "[271] 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]" "[350] 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]" "[330] 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]" "[410] 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]" "[386] $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]" "[387] 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:49,084 INFO L754 eck$LassoCheckResult]: Loop: "[389] 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[]" "[391] 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_38 .cse1) .cse0 .cse2 .cse3 (= v_~max2~0_37 .cse1)) (and (= v_~max2~0_38 v_~max2~0_37) (<= .cse1 v_~max2~0_38) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|)))) .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_38, #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_37, #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]" "[393] 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]" "[395] 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]" "[396] 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:49,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash -935044098, now seen corresponding path program 1 times [2025-04-26 16:43:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:49,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046944970] [2025-04-26 16:43:49,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:49,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-26 16:43:49,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-26 16:43:49,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:49,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:49,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-26 16:43:49,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-26 16:43:49,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:49,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:49,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 399917415, now seen corresponding path program 2 times [2025-04-26 16:43:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:49,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502964276] [2025-04-26 16:43:49,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:49,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:49,117 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,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:43:49,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:49,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:49,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:49,121 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,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:49,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:49,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:49,123 INFO L85 PathProgramCache]: Analyzing trace with hash -758326390, now seen corresponding path program 1 times [2025-04-26 16:43:49,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:49,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845914553] [2025-04-26 16:43:49,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:49,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-04-26 16:43:49,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-04-26 16:43:49,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:49,370 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,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:43:49,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845914553] [2025-04-26 16:43:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845914553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:43:49,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671334718] [2025-04-26 16:43:49,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:49,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:43:49,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:49,372 INFO L229 MonitoredProcess]: Starting monitored process 37 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,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-26 16:43:49,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-04-26 16:43:49,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-04-26 16:43:49,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:49,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:49,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:43:49,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:49,637 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,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:43:49,863 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,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671334718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:43:49,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:43:49,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2025-04-26 16:43:49,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667674888] [2025-04-26 16:43:49,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:43:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:43:49,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-26 16:43:49,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-04-26 16:43:49,955 INFO L87 Difference]: Start difference. First operand 3315 states and 4881 transitions. cyclomatic complexity: 1721 Second operand has 29 states, 29 states have (on average 6.310344827586207) internal successors, (in total 183), 29 states have internal predecessors, (183), 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,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:43:50,414 INFO L93 Difference]: Finished difference Result 5069 states and 7372 transitions. [2025-04-26 16:43:50,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5069 states and 7372 transitions. [2025-04-26 16:43:50,429 INFO L131 ngComponentsAnalysis]: Automaton has 67 accepting balls. 350 [2025-04-26 16:43:50,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5069 states to 4838 states and 7057 transitions. [2025-04-26 16:43:50,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2366 [2025-04-26 16:43:50,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2366 [2025-04-26 16:43:50,450 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4838 states and 7057 transitions. [2025-04-26 16:43:50,450 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:50,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4838 states and 7057 transitions. [2025-04-26 16:43:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states and 7057 transitions. [2025-04-26 16:43:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 3861. [2025-04-26 16:43:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3861 states, 3861 states have (on average 1.4654234654234655) internal successors, (in total 5658), 3860 states have internal predecessors, (5658), 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,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 5658 transitions. [2025-04-26 16:43:50,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3861 states and 5658 transitions. [2025-04-26 16:43:50,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-26 16:43:50,500 INFO L438 stractBuchiCegarLoop]: Abstraction has 3861 states and 5658 transitions. [2025-04-26 16:43:50,500 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:43:50,500 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3861 states and 5658 transitions. [2025-04-26 16:43:50,507 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 275 [2025-04-26 16:43:50,507 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:50,508 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:50,508 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] [2025-04-26 16:43:50,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:50,509 INFO L752 eck$LassoCheckResult]: Stem: "[265] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[275] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[327] 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[]" "[354] 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[]" "[286] 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[]" "[319] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 28)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[301] 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]" "[262] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[276] L41-1-->L41-2: Formula: (= v_~max2~0_7 0) InVars {} OutVars{~max2~0=v_~max2~0_7} AuxVars[] AssignedVars[~max2~0]" "[288] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[353] L41-3-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[368] 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]" "[323] 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]" "[245] 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]" "[370] 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]" "[272] 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]" "[290] 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]" "[240] 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]" "[238] 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]" "[312] 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]" "[374] 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]" "[291] 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]" "[244] 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]" "[241] 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]" "[249] 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]" "[355] 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]" "[347] 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]" "[364] 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]" "[295] 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[]" "[352] 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]" "[289] 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]" "[365] 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]" "[360] 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]" "[339] 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]" "[269] 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[]" "[310] 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]" "[304] 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]" "[343] 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]" "[361] 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]" "[366] 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]" "[308] 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-->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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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-->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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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]" "[252] 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[]" "[255] 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]" "[348] 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]" "[351] 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]" "[254] 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]" "[270] 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]" "[302] 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]" "[250] 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]" "[309] 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]" "[287] 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]" "[261] 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]" "[307] 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[]" "[283] 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]" "[318] 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]" "[345] 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]" "[333] 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]" "[299] 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]" "[416] 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]" "[375] $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]" "[376] 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]" "[378] 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[]" "[380] 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]" "[382] 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]" "[384] 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]" "[385] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[377] 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[]" "[379] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[381] 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]" "[383] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[317] 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]" "[329] 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]" "[271] 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]" "[350] 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]" "[330] 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]" "[410] 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]" "[386] $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]" "[387] 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,509 INFO L754 eck$LassoCheckResult]: Loop: "[389] 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[]" "[391] 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_38 .cse1) .cse0 .cse2 .cse3 (= v_~max2~0_37 .cse1)) (and (= v_~max2~0_38 v_~max2~0_37) (<= .cse1 v_~max2~0_38) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|)))) .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_38, #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_37, #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]" "[393] 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]" "[395] 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]" "[396] 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,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash -804092166, now seen corresponding path program 2 times [2025-04-26 16:43:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:50,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646590775] [2025-04-26 16:43:50,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:50,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-04-26 16:43:50,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-04-26 16:43:50,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:43:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:50,709 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:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:43:50,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646590775] [2025-04-26 16:43:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646590775] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:43:50,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703848289] [2025-04-26 16:43:50,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:43:50,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:50,713 INFO L229 MonitoredProcess]: Starting monitored process 38 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:50,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-26 16:43:50,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-04-26 16:43:50,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-04-26 16:43:50,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:43:50,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:50,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:43:50,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:50,909 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:50,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:43:51,084 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,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703848289] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:43:51,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:43:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2025-04-26 16:43:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488484345] [2025-04-26 16:43:51,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:43:51,085 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:43:51,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:51,085 INFO L85 PathProgramCache]: Analyzing trace with hash 399917415, now seen corresponding path program 3 times [2025-04-26 16:43:51,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:51,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862771544] [2025-04-26 16:43:51,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:43:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:51,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:51,088 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,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:43:51,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:51,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:51,090 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,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:43:51,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-26 16:43:51,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2025-04-26 16:43:51,192 INFO L87 Difference]: Start difference. First operand 3861 states and 5658 transitions. cyclomatic complexity: 1982 Second operand has 27 states, 27 states have (on average 6.222222222222222) internal successors, (in total 168), 27 states have internal predecessors, (168), 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,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:43:51,534 INFO L93 Difference]: Finished difference Result 4850 states and 7071 transitions. [2025-04-26 16:43:51,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4850 states and 7071 transitions. [2025-04-26 16:43:51,547 INFO L131 ngComponentsAnalysis]: Automaton has 67 accepting balls. 350 [2025-04-26 16:43:51,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4850 states to 4847 states and 7068 transitions. [2025-04-26 16:43:51,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2366 [2025-04-26 16:43:51,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2366 [2025-04-26 16:43:51,565 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4847 states and 7068 transitions. [2025-04-26 16:43:51,565 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:51,565 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4847 states and 7068 transitions. [2025-04-26 16:43:51,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states and 7068 transitions. [2025-04-26 16:43:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 3865. [2025-04-26 16:43:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3865 states, 3865 states have (on average 1.4652005174644243) internal successors, (in total 5663), 3864 states have internal predecessors, (5663), 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,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 5663 transitions. [2025-04-26 16:43:51,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3865 states and 5663 transitions. [2025-04-26 16:43:51,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-26 16:43:51,608 INFO L438 stractBuchiCegarLoop]: Abstraction has 3865 states and 5663 transitions. [2025-04-26 16:43:51,609 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:43:51,609 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3865 states and 5663 transitions. [2025-04-26 16:43:51,616 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 275 [2025-04-26 16:43:51,616 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:51,616 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:51,617 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] [2025-04-26 16:43:51,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:51,617 INFO L752 eck$LassoCheckResult]: Stem: "[265] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[275] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[327] 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[]" "[354] 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[]" "[286] 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[]" "[319] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 28)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[301] 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]" "[262] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[276] L41-1-->L41-2: Formula: (= v_~max2~0_7 0) InVars {} OutVars{~max2~0=v_~max2~0_7} AuxVars[] AssignedVars[~max2~0]" "[288] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[353] L41-3-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[368] 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]" "[323] 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]" "[245] 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]" "[370] 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]" "[272] 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]" "[290] 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]" "[240] 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]" "[238] 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]" "[312] 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]" "[374] 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]" "[291] 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]" "[244] 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]" "[241] 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]" "[249] 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]" "[355] 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]" "[347] 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]" "[364] 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]" "[295] 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[]" "[352] 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]" "[289] 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]" "[365] 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]" "[360] 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]" "[339] 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]" "[269] 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[]" "[310] 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]" "[304] 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]" "[343] 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]" "[361] 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]" "[366] 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]" "[308] 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-->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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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]" "[252] 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[]" "[255] 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]" "[348] 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]" "[351] 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]" "[254] 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]" "[270] 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]" "[302] 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]" "[250] 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]" "[309] 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]" "[287] 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]" "[261] 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]" "[307] 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[]" "[283] 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]" "[318] 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]" "[345] 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]" "[333] 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]" "[299] 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]" "[416] 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]" "[375] $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]" "[376] 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]" "[378] 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[]" "[380] 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]" "[382] 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]" "[384] 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]" "[385] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[377] 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[]" "[379] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[381] 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]" "[383] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[317] 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]" "[329] 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]" "[271] 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]" "[350] 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]" "[330] 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]" "[410] 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]" "[386] $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]" "[387] 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]" "[388] 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[]" "[390] L58-5-->L66: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[392] 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]" "[394] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[358] 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]" "[256] 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]" "[356] 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]" "[313] 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]" "[334] 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]" "[413] 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]" "[397] $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]" "[398] 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:51,618 INFO L754 eck$LassoCheckResult]: Loop: "[400] 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[]" "[402] L71-->L75: Formula: (let ((.cse5 (* v_thread3Thread1of1ForFork1_~i~2_9 4))) (let ((.cse4 (+ v_~A~0.offset_45 .cse5))) (let ((.cse0 (<= 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 .cse0 (let ((.cse1 (select (select |v_#memory_int_47| v_~A~0.base_45) .cse4))) (or (and (< v_~max2~0_46 .cse1) .cse0 .cse2 .cse3 (= v_~max2~0_45 .cse1)) (and (= v_~max2~0_46 v_~max2~0_45) (<= .cse1 v_~max2~0_46) (= |v_thread3Thread1of1ForFork1_#t~mem8_2| |v_thread3Thread1of1ForFork1_#t~mem8_1|)))) .cse2 .cse3)))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~max2~0=v_~max2~0_46, #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, ~max2~0=v_~max2~0_45, #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[~max2~0, thread3Thread1of1ForFork1_#t~mem8, thread3Thread1of1ForFork1_#t~mem7]" "[404] 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]" "[406] 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]" "[407] 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:51,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 393831073, now seen corresponding path program 1 times [2025-04-26 16:43:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:51,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470240618] [2025-04-26 16:43:51,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:51,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-26 16:43:51,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-26 16:43:51,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:51,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-26 16:43:51,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-26 16:43:51,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:51,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash 410414770, now seen corresponding path program 1 times [2025-04-26 16:43:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:51,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905139298] [2025-04-26 16:43:51,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:51,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:51,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:51,649 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,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:51,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:51,650 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,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:51,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash 277983250, now seen corresponding path program 1 times [2025-04-26 16:43:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:51,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271065958] [2025-04-26 16:43:51,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:43:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:51,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-26 16:43:51,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-26 16:43:51,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:51,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-26 16:43:51,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-26 16:43:51,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:51,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:51,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:52,804 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:43:52,805 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:43:52,805 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:43:52,805 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:43:52,805 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:43:52,805 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:52,805 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:43:52,805 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:43:52,805 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array.wvr.c_petrified1_Iteration7_Lasso [2025-04-26 16:43:52,805 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:43:52,805 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:43:52,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:52,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:53,619 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:43:53,619 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:43:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,621 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:53,623 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:53,624 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:53,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,641 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,646 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:53,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,647 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:53,648 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:53,649 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:53,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,661 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,666 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:53,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,668 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:53,668 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:53,669 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:53,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,681 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,687 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:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,689 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:53,690 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:53,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:53,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,705 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:53,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,711 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:53,712 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:53,713 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:53,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,722 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:43:53,722 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:43:53,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,730 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:43:53,730 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:43:53,744 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:43:53,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,751 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:53,752 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:53,753 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:53,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,765 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:53,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,771 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:53,772 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:53,773 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:53,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,786 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:43:53,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,792 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:53,793 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:53,794 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:53,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,807 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 16:43:53,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,813 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:53,814 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:53,814 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:53,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,827 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:43:53,831 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:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,834 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:53,835 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:53,835 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:53,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:43:53,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:43:53,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:43:53,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:43:53,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:43:53,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:43:53,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:43:53,867 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:43:53,867 INFO L437 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-04-26 16:43:53,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:53,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:43:53,869 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:53,870 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:53,870 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:43:53,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:43:53,885 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:43:53,885 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:43:53,885 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_2, thread3Thread1of1ForFork1_~i~2) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_2 - 2*thread3Thread1of1ForFork1_~i~2 Supporting invariants [] [2025-04-26 16:43:53,890 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:53,918 INFO L156 tatePredicateManager]: 11 out of 14 supporting invariants were superfluous and have been removed [2025-04-26 16:43:53,922 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:43:53,923 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:43:53,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:53,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-26 16:43:53,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-26 16:43:53,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:53,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:53,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:43:53,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:54,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:54,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:54,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:54,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:43:54,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:43:54,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:43:54,554 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:54,554 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:54,554 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3865 states and 5663 transitions. cyclomatic complexity: 1983 Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (in total 103), 11 states have internal predecessors, (103), 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:54,759 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3865 states and 5663 transitions. cyclomatic complexity: 1983. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (in total 103), 11 states have internal predecessors, (103), 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 6096 states and 8992 transitions. Complement of second has 17 states. [2025-04-26 16:43:54,760 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:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (in total 103), 11 states have internal predecessors, (103), 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:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 190 transitions. [2025-04-26 16:43:54,761 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 190 transitions. Stem has 98 letters. Loop has 5 letters. [2025-04-26 16:43:54,762 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:54,762 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 190 transitions. Stem has 103 letters. Loop has 5 letters. [2025-04-26 16:43:54,762 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:54,762 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 190 transitions. Stem has 98 letters. Loop has 10 letters. [2025-04-26 16:43:54,763 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:43:54,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6096 states and 8992 transitions. [2025-04-26 16:43:54,785 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 185 [2025-04-26 16:43:54,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6096 states to 2975 states and 4351 transitions. [2025-04-26 16:43:54,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1108 [2025-04-26 16:43:54,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1135 [2025-04-26 16:43:54,802 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2975 states and 4351 transitions. [2025-04-26 16:43:54,802 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:43:54,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2975 states and 4351 transitions. [2025-04-26 16:43:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states and 4351 transitions. [2025-04-26 16:43:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2951. [2025-04-26 16:43:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2951 states have (on average 1.4652660115215181) internal successors, (in total 4324), 2950 states have internal predecessors, (4324), 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:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4324 transitions. [2025-04-26 16:43:54,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2951 states and 4324 transitions. [2025-04-26 16:43:54,834 INFO L438 stractBuchiCegarLoop]: Abstraction has 2951 states and 4324 transitions. [2025-04-26 16:43:54,834 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:43:54,834 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2951 states and 4324 transitions. [2025-04-26 16:43:54,839 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 185 [2025-04-26 16:43:54,839 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:43:54,839 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:43:54,840 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] [2025-04-26 16:43:54,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:43:54,841 INFO L752 eck$LassoCheckResult]: Stem: "[265] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[275] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[327] 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[]" "[354] 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[]" "[286] 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[]" "[319] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 28)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[301] 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]" "[262] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[276] L41-1-->L41-2: Formula: (= v_~max2~0_7 0) InVars {} OutVars{~max2~0=v_~max2~0_7} AuxVars[] AssignedVars[~max2~0]" "[288] L41-2-->L41-3: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[353] L41-3-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[367] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[368] 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]" "[323] 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]" "[245] 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]" "[370] 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]" "[272] 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]" "[290] 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]" "[240] 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]" "[238] 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]" "[312] 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]" "[374] 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]" "[291] 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]" "[244] 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]" "[241] 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]" "[249] 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]" "[355] 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]" "[347] 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]" "[364] 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]" "[295] 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[]" "[352] 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]" "[289] 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]" "[365] 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]" "[360] 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]" "[339] 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]" "[269] 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[]" "[310] 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]" "[304] 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]" "[343] 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]" "[361] 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]" "[366] 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]" "[308] 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-->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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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-->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[]" "[251] 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]" "[349] 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]" "[328] 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]" "[278] 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]" "[316] 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]" "[259] 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]" "[252] 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[]" "[255] 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]" "[348] 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]" "[351] 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]" "[254] 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]" "[270] 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]" "[302] 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]" "[250] 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]" "[309] 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]" "[287] 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]" "[261] 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]" "[307] 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[]" "[283] 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]" "[318] 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]" "[345] 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]" "[333] 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]" "[299] 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]" "[416] 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]" "[375] $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]" "[376] 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]" "[378] 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[]" "[380] 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]" "[382] 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]" "[384] 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]" "[385] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[378] 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[]" "[380] 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]" "[382] 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]" "[384] 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]" "[385] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[377] 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[]" "[379] L46-5-->L54: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[381] 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]" "[383] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[317] 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]" "[329] 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]" "[271] 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]" "[350] 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]" "[330] 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]" "[410] 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]" "[386] $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]" "[387] 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:54,841 INFO L754 eck$LassoCheckResult]: Loop: "[389] 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[]" "[391] 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_38 .cse1) .cse0 .cse2 .cse3 (= v_~max2~0_37 .cse1)) (and (= v_~max2~0_38 v_~max2~0_37) (<= .cse1 v_~max2~0_38) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|)))) .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_38, #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_37, #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]" "[393] 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]" "[395] 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]" "[396] 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:54,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -626574813, now seen corresponding path program 3 times [2025-04-26 16:43:54,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:54,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413721636] [2025-04-26 16:43:54,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:43:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:54,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 3 equivalence classes. [2025-04-26 16:43:54,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 98 of 98 statements. [2025-04-26 16:43:54,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:43:54,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:54,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:54,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-26 16:43:54,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-26 16:43:54,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:54,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:54,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:54,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 399917415, now seen corresponding path program 4 times [2025-04-26 16:43:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:54,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363231197] [2025-04-26 16:43:54,890 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:43:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:54,892 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:43:54,893 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:54,893 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:43:54,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:54,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:54,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:43:54,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:43:54,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:54,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:54,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:54,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:43:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash 11013253, now seen corresponding path program 2 times [2025-04-26 16:43:54,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:43:54,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029687087] [2025-04-26 16:43:54,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:43:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:43:54,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-04-26 16:43:54,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-04-26 16:43:54,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:43:54,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:54,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:43:54,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-26 16:43:54,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-26 16:43:54,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:43:54,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:43:54,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:43:57,109 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:43:57,109 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:43:57,109 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:43:57,109 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:43:57,110 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:43:57,110 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:43:57,110 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:43:57,110 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:43:57,110 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array.wvr.c_petrified1_Iteration8_Lasso [2025-04-26 16:43:57,110 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:43:57,110 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:43:57,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:43:57,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:44:04,860 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2025-04-26 16:44:05,647 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:44:05,648 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:44:05,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,649 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:44:05,651 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:44:05,654 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:44:05,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,667 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,672 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:44:05,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,674 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:44:05,675 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:44:05,677 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:44:05,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:05,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:05,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:05,688 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,693 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:44:05,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,695 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:44:05,696 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:44:05,697 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:44:05,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:05,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:05,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:05,708 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,713 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:44:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,715 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:44:05,716 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:44:05,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:44:05,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,729 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,734 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:44:05,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,736 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:44:05,737 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:44:05,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:44:05,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,750 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,755 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:44:05,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,757 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:44:05,758 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:44:05,758 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:44:05,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,771 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,776 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:44:05,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,778 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:44:05,778 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:44:05,779 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:44:05,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,792 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,797 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:44:05,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,798 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:44:05,799 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:44:05,800 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:44:05,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:05,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:05,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:05,810 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,815 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:44:05,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,817 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:44:05,818 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:44:05,818 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:44:05,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,831 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:05,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,838 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:44:05,838 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:44:05,839 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:44:05,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:05,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:05,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:05,850 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,855 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:44:05,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,857 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:44:05,858 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:44:05,858 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:44:05,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,871 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,876 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:44:05,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,878 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:44:05,879 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:44:05,879 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:44:05,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:05,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:05,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:05,890 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,895 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:44:05,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,896 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:44:05,897 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:44:05,898 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:44:05,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:05,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:05,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:05,909 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,913 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:44:05,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,915 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:44:05,916 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:44:05,917 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:44:05,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,929 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:05,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,935 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:44:05,936 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:44:05,937 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:44:05,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:05,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:05,949 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:44:05,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,956 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:44:05,956 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:44:05,958 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:44:05,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:05,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:05,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:05,968 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,973 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:44:05,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,976 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:44:05,977 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:44:05,977 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:44:05,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:05,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:05,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:05,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:05,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:05,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:05,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:05,988 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:05,993 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:44:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:05,995 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:44:05,996 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:44:05,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:44:06,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,009 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,015 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:44:06,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,016 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:44:06,017 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:44:06,018 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:44:06,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,030 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,035 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:44:06,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,037 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:44:06,039 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:44:06,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:44:06,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,049 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,055 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:44:06,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,057 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:44:06,057 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:44:06,058 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:44:06,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,071 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,076 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:44:06,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,078 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:44:06,079 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:44:06,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:44:06,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,090 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:06,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,097 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:44:06,102 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:44:06,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:44:06,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,114 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,118 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:44:06,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,120 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:44:06,121 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:44:06,122 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:44:06,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,132 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,137 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:44:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,139 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:44:06,140 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:44:06,141 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:44:06,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,153 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,158 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:44:06,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,159 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:44:06,160 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:44:06,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:44:06,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,172 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,177 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:44:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,178 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:44:06,179 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:44:06,180 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:44:06,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,191 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-04-26 16:44:06,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,198 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:44:06,199 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:44:06,200 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:44:06,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,215 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,220 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:44:06,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,222 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:44:06,223 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:44:06,224 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:44:06,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,236 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:06,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,244 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:44:06,244 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:44:06,246 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:44:06,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,256 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:06,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,263 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:44:06,264 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:44:06,265 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:44:06,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,276 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,281 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:44:06,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,284 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:44:06,285 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:44:06,285 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:44:06,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,296 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,301 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:44:06,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,303 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:44:06,304 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:44:06,305 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:44:06,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,316 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,321 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:44:06,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,322 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:44:06,323 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:44:06,324 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:44:06,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,336 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,341 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:44:06,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,343 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:44:06,344 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:44:06,345 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:44:06,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,358 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-04-26 16:44:06,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,365 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:44:06,366 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:44:06,366 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:44:06,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,377 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,382 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:44:06,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,384 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:44:06,385 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:44:06,386 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:44:06,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,396 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,402 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:44:06,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,404 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:44:06,405 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:44:06,406 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:44:06,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,420 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,426 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:44:06,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,428 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:44:06,429 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:44:06,431 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:44:06,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,444 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:06,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,452 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:44:06,453 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:44:06,455 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:44:06,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:44:06,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:44:06,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:44:06,467 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:06,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,475 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:44:06,475 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:44:06,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:44:06,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,489 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,495 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:44:06,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,496 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:44:06,497 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:44:06,498 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:44:06,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,510 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,516 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:44:06,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,518 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:44:06,519 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:44:06,520 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:44:06,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,532 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:06,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,539 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:44:06,540 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:44:06,540 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:44:06,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,553 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:06,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,560 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:44:06,560 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:44:06,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:44:06,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:44:06,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:44:06,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,575 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-04-26 16:44:06,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,583 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:44:06,583 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:44:06,584 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:44:06,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,594 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:44:06,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:44:06,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,596 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:44:06,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:44:06,599 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:44:06,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:06,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,606 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:44:06,607 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:44:06,608 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:44:06,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:44:06,617 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-04-26 16:44:06,618 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:44:06,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:44:06,645 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2025-04-26 16:44:06,645 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:44:06,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:44:06,759 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:44:06,759 INFO L437 ModelExtractionUtils]: 50 out of 71 variables were initially zero. Simplification set additionally 18 variables to zero. [2025-04-26 16:44:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:44:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:44:06,761 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:44:06,762 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:44:06,763 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:44:06,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-04-26 16:44:06,779 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:44:06,779 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:44:06,779 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:44:06,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-04-26 16:44:06,824 INFO L156 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2025-04-26 16:44:06,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:44:06,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-26 16:44:06,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-26 16:44:06,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:44:06,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:44:06,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:44:06,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:44:06,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:44:06,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:44:06,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:44:06,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:44:06,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:44:06,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:44:07,003 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:44:07,004 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:44:07,004 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2951 states and 4324 transitions. cyclomatic complexity: 1486 Second operand has 5 states, 5 states have (on average 18.2) internal successors, (in total 91), 5 states have internal predecessors, (91), 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:44:07,068 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2951 states and 4324 transitions. cyclomatic complexity: 1486. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (in total 91), 5 states have internal predecessors, (91), 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 5769 states and 8470 transitions. Complement of second has 8 states. [2025-04-26 16:44:07,068 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:44:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (in total 91), 5 states have internal predecessors, (91), 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:44:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-04-26 16:44:07,069 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 211 transitions. Stem has 98 letters. Loop has 5 letters. [2025-04-26 16:44:07,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:44:07,070 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 211 transitions. Stem has 103 letters. Loop has 5 letters. [2025-04-26 16:44:07,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:44:07,070 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 211 transitions. Stem has 98 letters. Loop has 10 letters. [2025-04-26 16:44:07,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:44:07,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5769 states and 8470 transitions. [2025-04-26 16:44:07,087 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:44:07,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5769 states to 0 states and 0 transitions. [2025-04-26 16:44:07,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:44:07,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:44:07,087 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:44:07,087 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:44:07,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:44:07,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:44:07,087 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:44:07,087 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:44:07,087 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:44:07,087 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:44:07,088 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:44:07,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:07,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:44:07 BoogieIcfgContainer [2025-04-26 16:44:07,099 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:44:07,100 INFO L158 Benchmark]: Toolchain (without parser) took 25620.91ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 107.1MB in the beginning and 586.8MB in the end (delta: -479.6MB). Peak memory consumption was 238.3MB. Max. memory is 8.0GB. [2025-04-26 16:44:07,100 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:44:07,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.65ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 92.9MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:44:07,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.84ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 91.2MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:44:07,100 INFO L158 Benchmark]: Boogie Preprocessor took 37.00ms. Allocated memory is still 155.2MB. Free memory was 91.2MB in the beginning and 89.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:44:07,101 INFO L158 Benchmark]: RCFGBuilder took 405.63ms. Allocated memory is still 155.2MB. Free memory was 89.5MB in the beginning and 66.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-26 16:44:07,101 INFO L158 Benchmark]: BuchiAutomizer took 24886.67ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 66.1MB in the beginning and 586.8MB in the end (delta: -520.7MB). Peak memory consumption was 196.3MB. Max. memory is 8.0GB. [2025-04-26 16:44:07,102 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.87ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.65ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 92.9MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.84ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 91.2MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.00ms. Allocated memory is still 155.2MB. Free memory was 91.2MB in the beginning and 89.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 405.63ms. Allocated memory is still 155.2MB. Free memory was 89.5MB in the beginning and 66.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 24886.67ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 66.1MB in the beginning and 586.8MB in the end (delta: -520.7MB). Peak memory consumption was 196.3MB. 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 24.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 20.3s. 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, 2119 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, 1863 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1860 mSDsluCounter, 5563 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4568 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1612 IncrementalHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 995 mSDtfsCounter, 1612 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital282 mio100 ax119 hnf100 lsp349 ukn50 mio100 lsp51 div153 bol100 ite100 ukn100 eq152 hnf93 smp76 dnf264 smp69 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 174ms VariablesStem: 17 VariablesLoop: 14 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 663, Number of transitions in reduction automaton: 4799, Number of states in reduction automaton: 3328, 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 (((long long) -1 * i) + N) and consists of 5 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. 4 modules have a trivial ranking function, the largest among these consists of 29 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:44:07,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:44:07,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-26 16:44:07,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-26 16:44:07,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...