/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-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:40:15,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:40:15,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:40:15,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:40:15,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:40:15,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:40:15,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:40:15,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:40:15,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:40:15,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:40:15,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:40:15,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:40:15,725 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:40:15,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:40:15,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:40:15,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:40:15,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:40:15,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:40:15,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:40:15,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:40:15,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:40:15,727 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:40:15,727 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:40:15,727 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:40:15,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:40:15,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:40:15,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:40:15,945 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:40:15,945 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:40:15,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-26 16:40:17,195 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3cc22c61b/cc0dc4bebed2446d80a5f9fb76da7138/FLAG9e221b7e6 [2025-04-26 16:40:17,380 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:40:17,380 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-26 16:40:17,411 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3cc22c61b/cc0dc4bebed2446d80a5f9fb76da7138/FLAG9e221b7e6 [2025-04-26 16:40:18,195 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3cc22c61b/cc0dc4bebed2446d80a5f9fb76da7138 [2025-04-26 16:40:18,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:40:18,198 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:40:18,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:40:18,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:40:18,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:40:18,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe8d15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18, skipping insertion in model container [2025-04-26 16:40:18,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:40:18,379 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-bad-counter-queue.wvr.c[2142,2155] [2025-04-26 16:40:18,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:40:18,408 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:40:18,438 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-bad-counter-queue.wvr.c[2142,2155] [2025-04-26 16:40:18,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:40:18,458 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:40:18,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18 WrapperNode [2025-04-26 16:40:18,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:40:18,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:40:18,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:40:18,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:40:18,465 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:40:18" (1/1) ... [2025-04-26 16:40:18,472 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:40:18" (1/1) ... [2025-04-26 16:40:18,494 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 121 [2025-04-26 16:40:18,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:40:18,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:40:18,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:40:18,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:40:18,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:40:18,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:40:18,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:40:18,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:40:18,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (1/1) ... [2025-04-26 16:40:18,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:40:18,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:18,549 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:40:18,554 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:40:18,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:40:18,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:40:18,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:40:18,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:40:18,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:40:18,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:40:18,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 16:40:18,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 16:40:18,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:40:18,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:40:18,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 16:40:18,574 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:40:18,642 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:40:18,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:40:18,811 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:40:18,811 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:40:18,818 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:40:18,818 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:40:18,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:40:18 BoogieIcfgContainer [2025-04-26 16:40:18,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:40:18,819 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:40:18,819 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:40:18,823 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:40:18,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:40:18,823 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:40:18" (1/3) ... [2025-04-26 16:40:18,824 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@460d3eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:40:18, skipping insertion in model container [2025-04-26 16:40:18,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:40:18,824 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:40:18" (2/3) ... [2025-04-26 16:40:18,824 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@460d3eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:40:18, skipping insertion in model container [2025-04-26 16:40:18,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:40:18,825 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:40:18" (3/3) ... [2025-04-26 16:40:18,825 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-04-26 16:40:18,916 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:40:18,945 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:40:18,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:40:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:18,948 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:40:18,949 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:40:19,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 169 transitions, 352 flow [2025-04-26 16:40:19,061 INFO L116 PetriNetUnfolderBase]: 10/165 cut-off events. [2025-04-26 16:40:19,062 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:40:19,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 10/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2025-04-26 16:40:19,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 169 transitions, 352 flow [2025-04-26 16:40:19,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 165 transitions, 342 flow [2025-04-26 16:40:19,082 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 162 places, 165 transitions, 342 flow [2025-04-26 16:40:19,087 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:40:19,372 WARN L140 AmpleReduction]: Number of pruned transitions: 1541 [2025-04-26 16:40:19,372 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:40:19,372 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 15 [2025-04-26 16:40:19,372 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:167 [2025-04-26 16:40:19,372 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1080 [2025-04-26 16:40:19,372 WARN L145 AmpleReduction]: Times succ was already a loop node:12 [2025-04-26 16:40:19,372 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:28 [2025-04-26 16:40:19,372 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:40:19,378 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1263 states, 1261 states have (on average 1.1221252973830294) internal successors, (in total 1415), 1262 states have internal predecessors, (1415), 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:40:19,385 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:40:19,387 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:40:19,387 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:40:19,387 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:40:19,387 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:40:19,387 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:40:19,387 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:40:19,388 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:40:19,391 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1263 states, 1261 states have (on average 1.1221252973830294) internal successors, (in total 1415), 1262 states have internal predecessors, (1415), 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:40:19,430 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 1023 [2025-04-26 16:40:19,431 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:40:19,431 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:40:19,439 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] [2025-04-26 16:40:19,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:40:19,439 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:40:19,441 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1263 states, 1261 states have (on average 1.1221252973830294) internal successors, (in total 1415), 1262 states have internal predecessors, (1415), 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:40:19,456 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 1023 [2025-04-26 16:40:19,456 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:40:19,456 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:40:19,457 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] [2025-04-26 16:40:19,457 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:40:19,464 INFO L752 eck$LassoCheckResult]: Stem: "[239] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[247] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[317] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[346] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[309] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[278] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[322] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[235] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[360] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[362] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[244] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[273] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[358] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[314] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[297] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[224] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| 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_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[363] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[324] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_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_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[230] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#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_~size#1]" "[349] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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]" "[359] L84-1-->L35: 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]" "[348] L35-->L36: 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]" "[357] L36-->L35-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[]" "[337] L35-1-->L84-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]" "[236] L84-2-->L85: 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]" "[246] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[265] L85-1-->L35-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]" "[304] L35-2-->L36-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]" "[296] L36-3-->L35-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[]" "[216] L35-3-->L85-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]" "[211] L85-2-->L87: 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]" "[268] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[217] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[212] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[315] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" [2025-04-26 16:40:19,465 INFO L754 eck$LassoCheckResult]: Loop: "[331] L88-5-->L89: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[]" "[289] L89-->L89-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[264] L89-1-->L89-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|)) |v_#memory_int_3|) (<= 0 .cse1) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[#memory_int]" "[308] L89-2-->L88-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[223] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[287] L88-3-->L88-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[371] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" [2025-04-26 16:40:19,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash 557468674, now seen corresponding path program 1 times [2025-04-26 16:40:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:19,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232354401] [2025-04-26 16:40:19,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:19,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:40:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:40:19,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:19,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:19,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:19,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:40:19,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:40:19,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:19,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:19,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:19,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -909115888, now seen corresponding path program 1 times [2025-04-26 16:40:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:19,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314696229] [2025-04-26 16:40:19,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:19,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:40:19,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:40:19,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:19,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:19,595 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:19,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:40:19,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:40:19,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:19,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:19,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:19,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash -192323857, now seen corresponding path program 1 times [2025-04-26 16:40:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:19,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683600400] [2025-04-26 16:40:19,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:19,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:40:19,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:40:19,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:19,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:19,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:19,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:40:19,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:40:19,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:19,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:19,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:20,004 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:40:20,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:40:20,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:40:20,005 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:40:20,005 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:40:20,005 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,005 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:40:20,005 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:40:20,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_petrified1_Iteration1_Lasso [2025-04-26 16:40:20,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:40:20,005 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:40:20,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:20,584 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:40:20,587 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:40:20,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:20,589 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:40:20,590 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:40:20,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:20,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:20,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:20,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:20,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:20,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:20,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:20,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:20,607 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:20,613 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:40:20,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:20,615 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:40:20,616 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:40:20,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:20,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:20,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:20,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:20,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:20,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:20,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:20,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:20,629 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:20,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:40:20,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:20,636 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:40:20,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:20,645 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:40:20,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:20,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:20,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:20,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:20,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:20,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:20,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:20,654 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:20,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:40:20,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:20,662 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:40:20,662 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:40:20,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:20,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:20,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:20,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:20,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:20,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:20,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:20,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:20,677 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:20,683 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:40:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:20,685 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:40:20,686 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:40:20,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:20,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:20,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:20,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:20,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:20,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:20,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:20,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:20,706 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:20,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:40:20,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:20,713 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:40:20,714 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:40:20,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:20,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:20,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:20,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:20,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:20,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:20,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:20,730 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:20,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:40:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:20,738 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:40:20,739 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:40:20,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:20,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:20,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:20,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:20,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:20,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:20,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:20,770 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:40:20,788 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:40:20,788 INFO L437 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-04-26 16:40:20,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:20,791 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:40:20,793 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:40:20,794 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:40:20,811 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:40:20,811 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:40:20,811 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:40:20,812 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~2#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~2#1 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset >= 0] [2025-04-26 16:40:20,819 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:40:20,831 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-04-26 16:40:20,838 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:40:20,839 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:40:20,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:20,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:40:20,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:40:20,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:20,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:40:20,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:40:20,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:40:20,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:40:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:40:20,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:20,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:40:20,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:40:20,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:40:21,074 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:40:21,091 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2025-04-26 16:40:21,093 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 1263 states, 1261 states have (on average 1.1221252973830294) internal successors, (in total 1415), 1262 states have internal predecessors, (1415), 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 8 states, 8 states have (on average 5.375) internal successors, (in total 43), 8 states have internal predecessors, (43), 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:40:21,262 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 1263 states, 1261 states have (on average 1.1221252973830294) internal successors, (in total 1415), 1262 states have internal predecessors, (1415), 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 8 states, 8 states have (on average 5.375) internal successors, (in total 43), 8 states have internal predecessors, (43), 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 2512 states and 2818 transitions. Complement of second has 13 states. [2025-04-26 16:40:21,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:40:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (in total 43), 8 states have internal predecessors, (43), 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:40:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2025-04-26 16:40:21,269 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 189 transitions. Stem has 36 letters. Loop has 7 letters. [2025-04-26 16:40:21,269 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:21,269 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 189 transitions. Stem has 43 letters. Loop has 7 letters. [2025-04-26 16:40:21,270 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:21,270 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 189 transitions. Stem has 36 letters. Loop has 14 letters. [2025-04-26 16:40:21,270 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:21,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2512 states and 2818 transitions. [2025-04-26 16:40:21,288 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 1016 [2025-04-26 16:40:21,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2512 states to 1204 states and 1339 transitions. [2025-04-26 16:40:21,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1195 [2025-04-26 16:40:21,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1197 [2025-04-26 16:40:21,306 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1204 states and 1339 transitions. [2025-04-26 16:40:21,310 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:40:21,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1204 states and 1339 transitions. [2025-04-26 16:40:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states and 1339 transitions. [2025-04-26 16:40:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1203. [2025-04-26 16:40:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1203 states have (on average 1.112219451371571) internal successors, (in total 1338), 1202 states have internal predecessors, (1338), 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:40:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1338 transitions. [2025-04-26 16:40:21,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1203 states and 1338 transitions. [2025-04-26 16:40:21,368 INFO L438 stractBuchiCegarLoop]: Abstraction has 1203 states and 1338 transitions. [2025-04-26 16:40:21,368 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:40:21,368 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1203 states and 1338 transitions. [2025-04-26 16:40:21,372 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 1016 [2025-04-26 16:40:21,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:40:21,372 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:40:21,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] [2025-04-26 16:40:21,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2025-04-26 16:40:21,377 INFO L752 eck$LassoCheckResult]: Stem: "[239] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[247] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[317] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[346] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[309] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[278] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[322] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[235] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[360] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[362] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[244] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[273] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[358] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[314] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[297] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[224] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| 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_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[363] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[324] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_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_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[230] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#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_~size#1]" "[349] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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]" "[359] L84-1-->L35: 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]" "[348] L35-->L36: 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]" "[357] L36-->L35-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[]" "[337] L35-1-->L84-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]" "[236] L84-2-->L85: 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]" "[246] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[265] L85-1-->L35-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]" "[304] L35-2-->L36-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]" "[296] L36-3-->L35-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[]" "[216] L35-3-->L85-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]" "[211] L85-2-->L87: 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]" "[268] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[217] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[212] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[315] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[330] L88-5-->L88-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[]" "[298] L88-6-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[231] L91-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[343] create_fresh_int_array_returnLabel#1-->L69-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[243] L69-3-->L69-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[210] L69-4-->L69-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[262] L69-5-->L69-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[366] L69-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[281] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[285] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[214] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[459] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_16|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[375] $Ultimate##0-->L48: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1| |v_thread1Thread1of1ForFork0_~_argptr#1.base_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} OutVars{thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base]" "[376] L48-->L48-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" [2025-04-26 16:40:21,377 INFO L754 eck$LassoCheckResult]: Loop: "[378] L48-5-->L49: Formula: (< |v_thread1Thread1of1ForFork0_~i~0#1_5| v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[380] L49-->L49-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_1))) (and (= |v_thread1Thread1of1ForFork0_#t~mem1#1_1| (select (select |v_#memory_int_1| v_~A~0.base_1) .cse0)) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_1 4) (select |v_#length_1| v_~A~0.base_1)) (= (select |v_#valid_1| v_~A~0.base_1) 1)))) InVars {#memory_int=|v_#memory_int_1|, ~A~0.base=v_~A~0.base_1, #length=|v_#length_1|, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|} OutVars{~A~0.base=v_~A~0.base_1, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[382] L49-1-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_1| |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_1| v_~counter~0_1)) InVars {~counter~0=v_~counter~0_1, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{~counter~0=v_~counter~0_1, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_1|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[384] L49-2-->L49-3: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[385] L49-3-->L100: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[386] L100-->L100-1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_3| |v_thread1Thread1of1ForFork0_plus_~a#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_3|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1]" "[387] L100-1-->L101: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_3| |v_thread1Thread1of1ForFork0_plus_~b#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~b#1]" "[388] L101-->L101-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[389] L101-1-->L35: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[390] L35-->L36: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[392] L36-->L35-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[394] L35-1-->L101-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[395] L101-2-->L102: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[396] L102-->L102-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (or (<= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_7| |v_thread1Thread1of1ForFork0_plus_~b#1_7|) 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_7| 0)) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[397] L102-1-->L35-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[398] L35-2-->L36-3: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[400] L36-3-->L35-3: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[402] L35-3-->L102-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[403] L102-2-->L103: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[404] L103-->plus_returnLabel#1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_3| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_9| |v_thread1Thread1of1ForFork0_plus_~b#1_9|)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[405] plus_returnLabel#1-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_#t~ret2#1_1|) InVars {thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[406] L49-4-->L49-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_11|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[407] L49-5-->L49-6: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[408] L49-6-->L49-7: Formula: (= |v_thread1Thread1of1ForFork0_~tmp~0#1_1| |v_thread1Thread1of1ForFork0_#t~ret2#1_3|) InVars {thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_1|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1]" "[409] L49-7-->L49-8: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[410] L49-8-->L50: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[411] L50-->L50-1: Formula: (= v_~counter~0_2 |v_thread1Thread1of1ForFork0_~tmp~0#1_3|) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_3|} OutVars{~counter~0=v_~counter~0_2, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_3|} AuxVars[] AssignedVars[~counter~0]" "[412] L50-1-->L48-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1]" "[413] L48-2-->L48-3: Formula: (= |v_thread1Thread1of1ForFork0_#t~post3#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_11|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" "[414] L48-3-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_13| (+ |v_thread1Thread1of1ForFork0_#t~post3#1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" "[415] L48-4-->L48-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" [2025-04-26 16:40:21,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash -365983789, now seen corresponding path program 1 times [2025-04-26 16:40:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:21,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476128747] [2025-04-26 16:40:21,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:21,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:21,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:40:21,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:40:21,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:21,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:21,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:21,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:40:21,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:40:21,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:21,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:21,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:21,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash -73402261, now seen corresponding path program 1 times [2025-04-26 16:40:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:21,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074686286] [2025-04-26 16:40:21,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:21,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:21,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:21,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:21,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:21,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:21,426 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:21,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:21,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:21,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:21,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:21,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:21,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1261177255, now seen corresponding path program 1 times [2025-04-26 16:40:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:21,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91183714] [2025-04-26 16:40:21,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:21,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-26 16:40:21,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-26 16:40:21,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:21,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:40:21,690 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:40:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:40:21,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91183714] [2025-04-26 16:40:21,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91183714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:40:21,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:40:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:40:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820273323] [2025-04-26 16:40:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:40:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:40:21,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:40:21,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-26 16:40:21,787 INFO L87 Difference]: Start difference. First operand 1203 states and 1338 transitions. cyclomatic complexity: 158 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:40:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:40:21,904 INFO L93 Difference]: Finished difference Result 1365 states and 1435 transitions. [2025-04-26 16:40:21,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1365 states and 1435 transitions. [2025-04-26 16:40:21,910 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 1078 [2025-04-26 16:40:21,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1365 states to 1289 states and 1359 transitions. [2025-04-26 16:40:21,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1277 [2025-04-26 16:40:21,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1277 [2025-04-26 16:40:21,916 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1289 states and 1359 transitions. [2025-04-26 16:40:21,917 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:40:21,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1289 states and 1359 transitions. [2025-04-26 16:40:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states and 1359 transitions. [2025-04-26 16:40:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1149. [2025-04-26 16:40:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1149 states have (on average 1.0583115752828547) internal successors, (in total 1216), 1148 states have internal predecessors, (1216), 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:40:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1216 transitions. [2025-04-26 16:40:21,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1149 states and 1216 transitions. [2025-04-26 16:40:21,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-26 16:40:21,933 INFO L438 stractBuchiCegarLoop]: Abstraction has 1149 states and 1216 transitions. [2025-04-26 16:40:21,933 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:40:21,933 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1216 transitions. [2025-04-26 16:40:21,936 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 954 [2025-04-26 16:40:21,936 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:40:21,936 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:40:21,936 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] [2025-04-26 16:40:21,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2025-04-26 16:40:21,937 INFO L752 eck$LassoCheckResult]: Stem: "[239] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[247] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[317] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[346] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[309] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[278] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[322] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[235] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[360] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[362] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[244] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[273] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[358] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[314] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[297] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[224] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| 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_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[363] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[324] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_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_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[230] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#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_~size#1]" "[349] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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]" "[359] L84-1-->L35: 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]" "[348] L35-->L36: 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]" "[357] L36-->L35-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[]" "[337] L35-1-->L84-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]" "[236] L84-2-->L85: 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]" "[246] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[265] L85-1-->L35-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]" "[304] L35-2-->L36-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]" "[296] L36-3-->L35-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[]" "[216] L35-3-->L85-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]" "[211] L85-2-->L87: 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]" "[268] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[217] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[212] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[315] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[331] L88-5-->L89: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[]" "[289] L89-->L89-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[264] L89-1-->L89-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|)) |v_#memory_int_3|) (<= 0 .cse1) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[#memory_int]" "[308] L89-2-->L88-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[223] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[287] L88-3-->L88-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[371] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[330] L88-5-->L88-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[]" "[298] L88-6-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[231] L91-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[343] create_fresh_int_array_returnLabel#1-->L69-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[243] L69-3-->L69-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[210] L69-4-->L69-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[262] L69-5-->L69-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[366] L69-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[281] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[285] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[214] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[459] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_16|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[375] $Ultimate##0-->L48: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1| |v_thread1Thread1of1ForFork0_~_argptr#1.base_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} OutVars{thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base]" "[376] L48-->L48-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" [2025-04-26 16:40:21,937 INFO L754 eck$LassoCheckResult]: Loop: "[378] L48-5-->L49: Formula: (< |v_thread1Thread1of1ForFork0_~i~0#1_5| v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[380] L49-->L49-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_1))) (and (= |v_thread1Thread1of1ForFork0_#t~mem1#1_1| (select (select |v_#memory_int_1| v_~A~0.base_1) .cse0)) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_1 4) (select |v_#length_1| v_~A~0.base_1)) (= (select |v_#valid_1| v_~A~0.base_1) 1)))) InVars {#memory_int=|v_#memory_int_1|, ~A~0.base=v_~A~0.base_1, #length=|v_#length_1|, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|} OutVars{~A~0.base=v_~A~0.base_1, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[382] L49-1-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_1| |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_1| v_~counter~0_1)) InVars {~counter~0=v_~counter~0_1, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{~counter~0=v_~counter~0_1, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_1|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[384] L49-2-->L49-3: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[385] L49-3-->L100: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[386] L100-->L100-1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_3| |v_thread1Thread1of1ForFork0_plus_~a#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_3|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1]" "[387] L100-1-->L101: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_3| |v_thread1Thread1of1ForFork0_plus_~b#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~b#1]" "[388] L101-->L101-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[389] L101-1-->L35: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[390] L35-->L36: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[392] L36-->L35-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[394] L35-1-->L101-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[395] L101-2-->L102: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[396] L102-->L102-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (or (<= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_7| |v_thread1Thread1of1ForFork0_plus_~b#1_7|) 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_7| 0)) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[397] L102-1-->L35-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[398] L35-2-->L36-3: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[400] L36-3-->L35-3: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[402] L35-3-->L102-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[403] L102-2-->L103: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[404] L103-->plus_returnLabel#1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_3| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_9| |v_thread1Thread1of1ForFork0_plus_~b#1_9|)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[405] plus_returnLabel#1-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_#t~ret2#1_1|) InVars {thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[406] L49-4-->L49-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_11|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[407] L49-5-->L49-6: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[408] L49-6-->L49-7: Formula: (= |v_thread1Thread1of1ForFork0_~tmp~0#1_1| |v_thread1Thread1of1ForFork0_#t~ret2#1_3|) InVars {thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_1|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1]" "[409] L49-7-->L49-8: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[410] L49-8-->L50: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[411] L50-->L50-1: Formula: (= v_~counter~0_2 |v_thread1Thread1of1ForFork0_~tmp~0#1_3|) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_3|} OutVars{~counter~0=v_~counter~0_2, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_3|} AuxVars[] AssignedVars[~counter~0]" "[412] L50-1-->L48-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1]" "[413] L48-2-->L48-3: Formula: (= |v_thread1Thread1of1ForFork0_#t~post3#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_11|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" "[414] L48-3-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_13| (+ |v_thread1Thread1of1ForFork0_#t~post3#1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" "[415] L48-4-->L48-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" [2025-04-26 16:40:21,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash -455575552, now seen corresponding path program 1 times [2025-04-26 16:40:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:21,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382658420] [2025-04-26 16:40:21,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:21,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:40:21,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:40:21,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:21,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:21,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:21,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:40:21,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:40:21,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:21,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:21,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:21,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash -73402261, now seen corresponding path program 2 times [2025-04-26 16:40:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:21,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087701375] [2025-04-26 16:40:21,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:40:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:21,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:21,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:21,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:40:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:21,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:21,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:21,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:21,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:21,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:21,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:21,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1853341556, now seen corresponding path program 1 times [2025-04-26 16:40:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:21,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275381715] [2025-04-26 16:40:21,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:21,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-26 16:40:22,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:40:22,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:22,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:22,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:22,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-26 16:40:22,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:40:22,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:22,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:22,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:22,613 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:40:22,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:40:22,613 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:40:22,613 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:40:22,613 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:40:22,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:22,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:40:22,614 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:40:22,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_petrified1_Iteration3_Lasso [2025-04-26 16:40:22,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:40:22,614 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:40:22,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:22,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:23,296 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:40:23,296 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:40:23,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,298 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:40:23,299 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:40:23,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,312 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:40:23,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,319 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:40:23,320 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:40:23,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,332 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,337 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:40:23,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,339 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:40:23,340 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:40:23,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,352 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,357 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:40:23,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,359 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:40:23,360 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:40:23,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,372 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,377 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:40:23,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,379 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:40:23,380 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:40:23,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,392 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,397 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:40:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,399 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:40:23,400 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:40:23,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,412 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:40:23,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,419 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:40:23,420 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:40:23,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,432 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,437 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:40:23,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,439 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:40:23,439 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:40:23,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:23,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:23,453 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,459 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:40:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,461 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:40:23,463 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:40:23,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:23,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:23,478 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:40:23,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,498 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:40:23,499 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:40:23,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:23,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:23,513 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:40:23,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,521 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:40:23,522 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:40:23,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:23,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:23,538 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:40:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,546 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:40:23,547 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:40:23,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,567 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:40:23,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,569 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:40:23,570 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:40:23,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:23,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:23,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:23,583 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,589 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:40:23,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,592 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:40:23,593 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:40:23,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:23,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:23,609 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:23,614 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:40:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,616 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:40:23,617 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:40:23,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:23,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:23,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:23,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:23,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:23,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:23,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:23,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:40:23,653 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:40:23,653 INFO L437 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:40:23,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:23,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:23,655 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:40:23,655 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:40:23,656 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:40:23,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:40:23,672 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:40:23,672 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:40:23,672 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_~i~0#1) = -4*thread1Thread1of1ForFork0_~i~0#1 + 4294967289 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_1 + 1*~A~0.offset + 4294967292 >= 0] [2025-04-26 16:40:23,678 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:40:23,703 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2025-04-26 16:40:23,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:23,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:40:23,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:40:23,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:23,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:40:23,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:40:23,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:40:23,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-26 16:40:23,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:24,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:24,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:24,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:40:24,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:40:24,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:40:24,285 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:40:24,285 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:40:24,285 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1149 states and 1216 transitions. cyclomatic complexity: 90 Second operand has 11 states, 11 states have (on average 8.0) internal successors, (in total 88), 11 states have internal predecessors, (88), 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:40:24,550 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1149 states and 1216 transitions. cyclomatic complexity: 90. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (in total 88), 11 states have internal predecessors, (88), 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 1965 states and 2081 transitions. Complement of second has 17 states. [2025-04-26 16:40:24,551 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:40:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 8.0) internal successors, (in total 88), 11 states have internal predecessors, (88), 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:40:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2025-04-26 16:40:24,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 136 transitions. Stem has 57 letters. Loop has 31 letters. [2025-04-26 16:40:24,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:24,553 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 136 transitions. Stem has 88 letters. Loop has 31 letters. [2025-04-26 16:40:24,555 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:24,555 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 136 transitions. Stem has 57 letters. Loop has 62 letters. [2025-04-26 16:40:24,555 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:24,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1965 states and 2081 transitions. [2025-04-26 16:40:24,567 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 403 [2025-04-26 16:40:24,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1965 states to 1392 states and 1480 transitions. [2025-04-26 16:40:24,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 816 [2025-04-26 16:40:24,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 830 [2025-04-26 16:40:24,576 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1392 states and 1480 transitions. [2025-04-26 16:40:24,576 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:40:24,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1480 transitions. [2025-04-26 16:40:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states and 1480 transitions. [2025-04-26 16:40:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1390. [2025-04-26 16:40:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1390 states have (on average 1.0633093525179855) internal successors, (in total 1478), 1389 states have internal predecessors, (1478), 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:40:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1478 transitions. [2025-04-26 16:40:24,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1390 states and 1478 transitions. [2025-04-26 16:40:24,599 INFO L438 stractBuchiCegarLoop]: Abstraction has 1390 states and 1478 transitions. [2025-04-26 16:40:24,599 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:40:24,599 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1390 states and 1478 transitions. [2025-04-26 16:40:24,602 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 403 [2025-04-26 16:40:24,602 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:40:24,602 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:40:24,604 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:40:24,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2025-04-26 16:40:24,606 INFO L752 eck$LassoCheckResult]: Stem: "[239] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[247] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[317] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[346] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[309] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[278] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[322] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[235] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[360] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[362] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[244] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[273] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[358] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[314] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[297] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[224] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| 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_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[363] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[324] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_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_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[230] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#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_~size#1]" "[349] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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]" "[359] L84-1-->L35: 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]" "[348] L35-->L36: 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]" "[357] L36-->L35-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[]" "[337] L35-1-->L84-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]" "[236] L84-2-->L85: 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]" "[246] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[265] L85-1-->L35-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]" "[304] L35-2-->L36-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]" "[296] L36-3-->L35-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[]" "[216] L35-3-->L85-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]" "[211] L85-2-->L87: 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]" "[268] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[217] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[212] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[315] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[330] L88-5-->L88-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[]" "[298] L88-6-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[231] L91-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[343] create_fresh_int_array_returnLabel#1-->L69-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[243] L69-3-->L69-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[210] L69-4-->L69-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[262] L69-5-->L69-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[366] L69-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[281] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[285] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[214] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[459] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_16|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[375] $Ultimate##0-->L48: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1| |v_thread1Thread1of1ForFork0_~_argptr#1.base_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} OutVars{thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base]" "[376] L48-->L48-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" "[377] L48-5-->L48-6: Formula: (<= v_~N~0_2 |v_thread1Thread1of1ForFork0_~i~0#1_3|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_3|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_3|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[379] L48-6-->L53: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" "[381] L53-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base]" "[383] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[364] L72-4-->L72-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[292] L72-5-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[319] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[340] L73-1-->L73-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[241] L73-2-->L73-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre11#1_2|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[462] L73-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4| 0) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_14|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_14|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_8|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_16|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_8|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_14|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_22|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_8|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_8|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_8|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_8|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_4|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_8|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.offset, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[416] $Ultimate##0-->L57: Formula: (and (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork1_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork1_~_argptr#1.offset_1| |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base]" "[417] L57-->L57-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" [2025-04-26 16:40:24,606 INFO L754 eck$LassoCheckResult]: Loop: "[419] L57-5-->L58: Formula: (< |v_thread2Thread1of1ForFork1_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[421] L58-->L58-1: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_2))) (and (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_2 4) (select |v_#length_2| v_~A~0.base_2)) (= (select (select |v_#memory_int_2| v_~A~0.base_2) .cse0) |v_thread2Thread1of1ForFork1_#t~mem4#1_1|) (= (select |v_#valid_2| v_~A~0.base_2) 1)))) InVars {#memory_int=|v_#memory_int_2|, ~A~0.base=v_~A~0.base_2, #length=|v_#length_2|, ~A~0.offset=v_~A~0.offset_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|, #valid=|v_#valid_2|} OutVars{~A~0.base=v_~A~0.base_2, ~A~0.offset=v_~A~0.offset_2, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_2|, #length=|v_#length_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4#1]" "[423] L58-1-->L58-2: Formula: (and (= v_~counter~0_4 |v_thread2Thread1of1ForFork1_minus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork1_#t~mem4#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_1|)) InVars {thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_3|, ~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_4, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_1|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_1|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[425] L58-2-->L58-3: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[426] L58-3-->L94: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_1|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[427] L94-->L94-1: Formula: (= |v_thread2Thread1of1ForFork1_minus_~a#1_3| |v_thread2Thread1of1ForFork1_minus_#in~a#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_3|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1]" "[428] L94-1-->L95: Formula: (= |v_thread2Thread1of1ForFork1_minus_~b#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_3|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1]" "[429] L95-->L95-1: Formula: (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[430] L95-1-->L35: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[431] L35-->L36: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[433] L36-->L35-1: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[435] L35-1-->L95-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[436] L95-2-->L96: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[437] L96-->L96-1: Formula: (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_7|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_7| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_7|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[438] L96-1-->L35-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[439] L35-2-->L36-3: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[441] L36-3-->L35-3: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[443] L35-3-->L96-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[444] L96-2-->L97: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[445] L97-->minus_returnLabel#1: Formula: (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_3| |v_thread2Thread1of1ForFork1_minus_~b#1_9|) |v_thread2Thread1of1ForFork1_minus_~a#1_9|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[446] minus_returnLabel#1-->L58-4: Formula: (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_#t~ret5#1_1|) InVars {thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[447] L58-4-->L58-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_11|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[448] L58-5-->L58-6: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[449] L58-6-->L58-7: Formula: (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_#t~ret5#1_3|) InVars {thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} OutVars{thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~tmp~1#1]" "[450] L58-7-->L58-8: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4#1]" "[451] L58-8-->L59: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[452] L59-->L59-1: Formula: (= v_~counter~0_3 |v_thread2Thread1of1ForFork1_~tmp~1#1_3|) InVars {thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_3|} OutVars{~counter~0=v_~counter~0_3, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_3|} AuxVars[] AssignedVars[~counter~0]" "[453] L59-1-->L57-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~tmp~1#1]" "[454] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork1_#t~post6#1_1| |v_thread2Thread1of1ForFork1_~i~1#1_11|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" "[455] L57-3-->L57-4: Formula: (= (+ |v_thread2Thread1of1ForFork1_#t~post6#1_3| 1) |v_thread2Thread1of1ForFork1_~i~1#1_13|) InVars {thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" "[456] L57-4-->L57-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" [2025-04-26 16:40:24,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash 793316866, now seen corresponding path program 1 times [2025-04-26 16:40:24,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:24,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989962808] [2025-04-26 16:40:24,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:24,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-26 16:40:24,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-26 16:40:24,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:24,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:24,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:24,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-26 16:40:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-26 16:40:24,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:24,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:24,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:24,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1102557260, now seen corresponding path program 1 times [2025-04-26 16:40:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:24,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651731765] [2025-04-26 16:40:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:24,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:24,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:24,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:24,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:24,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:24,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:24,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:24,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:24,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:24,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:24,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash 294502803, now seen corresponding path program 1 times [2025-04-26 16:40:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:24,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850067796] [2025-04-26 16:40:24,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:24,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-26 16:40:24,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-26 16:40:24,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:24,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:40:24,792 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:40:24,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:40:24,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850067796] [2025-04-26 16:40:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850067796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:40:24,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:40:24,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:40:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987446974] [2025-04-26 16:40:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:40:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:40:24,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:40:24,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-26 16:40:24,886 INFO L87 Difference]: Start difference. First operand 1390 states and 1478 transitions. cyclomatic complexity: 111 Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (in total 93), 7 states have internal predecessors, (93), 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:40:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:40:24,969 INFO L93 Difference]: Finished difference Result 1407 states and 1494 transitions. [2025-04-26 16:40:24,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1407 states and 1494 transitions. [2025-04-26 16:40:24,974 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 403 [2025-04-26 16:40:24,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1407 states to 1381 states and 1468 transitions. [2025-04-26 16:40:24,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 814 [2025-04-26 16:40:24,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 814 [2025-04-26 16:40:24,980 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1381 states and 1468 transitions. [2025-04-26 16:40:24,980 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:40:24,980 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1381 states and 1468 transitions. [2025-04-26 16:40:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states and 1468 transitions. [2025-04-26 16:40:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1376. [2025-04-26 16:40:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1376 states have (on average 1.0632267441860466) internal successors, (in total 1463), 1375 states have internal predecessors, (1463), 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:40:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1463 transitions. [2025-04-26 16:40:24,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1376 states and 1463 transitions. [2025-04-26 16:40:25,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-26 16:40:25,000 INFO L438 stractBuchiCegarLoop]: Abstraction has 1376 states and 1463 transitions. [2025-04-26 16:40:25,000 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:40:25,000 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1376 states and 1463 transitions. [2025-04-26 16:40:25,003 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 403 [2025-04-26 16:40:25,004 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:40:25,004 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:40:25,006 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] [2025-04-26 16:40:25,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2025-04-26 16:40:25,007 INFO L752 eck$LassoCheckResult]: Stem: "[239] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[247] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[317] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[346] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[309] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[278] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[322] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[235] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[360] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[362] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[244] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[273] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[358] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[314] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[297] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[224] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| 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_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[363] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[324] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_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_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[230] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#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_~size#1]" "[349] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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]" "[359] L84-1-->L35: 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]" "[348] L35-->L36: 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]" "[357] L36-->L35-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[]" "[337] L35-1-->L84-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]" "[236] L84-2-->L85: 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]" "[246] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[265] L85-1-->L35-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]" "[304] L35-2-->L36-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]" "[296] L36-3-->L35-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[]" "[216] L35-3-->L85-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]" "[211] L85-2-->L87: 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]" "[268] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[217] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[212] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[315] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[331] L88-5-->L89: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[]" "[289] L89-->L89-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[264] L89-1-->L89-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|)) |v_#memory_int_3|) (<= 0 .cse1) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[#memory_int]" "[308] L89-2-->L88-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[223] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[287] L88-3-->L88-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[371] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[330] L88-5-->L88-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[]" "[298] L88-6-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[231] L91-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[343] create_fresh_int_array_returnLabel#1-->L69-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[243] L69-3-->L69-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[210] L69-4-->L69-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[262] L69-5-->L69-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[366] L69-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[281] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[285] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[214] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[459] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_16|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[375] $Ultimate##0-->L48: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1| |v_thread1Thread1of1ForFork0_~_argptr#1.base_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} OutVars{thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base]" "[376] L48-->L48-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" "[378] L48-5-->L49: Formula: (< |v_thread1Thread1of1ForFork0_~i~0#1_5| v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[380] L49-->L49-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_1))) (and (= |v_thread1Thread1of1ForFork0_#t~mem1#1_1| (select (select |v_#memory_int_1| v_~A~0.base_1) .cse0)) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_1 4) (select |v_#length_1| v_~A~0.base_1)) (= (select |v_#valid_1| v_~A~0.base_1) 1)))) InVars {#memory_int=|v_#memory_int_1|, ~A~0.base=v_~A~0.base_1, #length=|v_#length_1|, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|} OutVars{~A~0.base=v_~A~0.base_1, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[364] L72-4-->L72-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[292] L72-5-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[319] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[340] L73-1-->L73-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[241] L73-2-->L73-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre11#1_2|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[462] L73-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4| 0) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_14|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_14|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_8|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_16|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_8|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_14|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_22|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_8|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_8|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_8|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_8|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_4|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_8|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.offset, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[416] $Ultimate##0-->L57: Formula: (and (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork1_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork1_~_argptr#1.offset_1| |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base]" "[417] L57-->L57-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" [2025-04-26 16:40:25,007 INFO L754 eck$LassoCheckResult]: Loop: "[419] L57-5-->L58: Formula: (< |v_thread2Thread1of1ForFork1_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[421] L58-->L58-1: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_2))) (and (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_2 4) (select |v_#length_2| v_~A~0.base_2)) (= (select (select |v_#memory_int_2| v_~A~0.base_2) .cse0) |v_thread2Thread1of1ForFork1_#t~mem4#1_1|) (= (select |v_#valid_2| v_~A~0.base_2) 1)))) InVars {#memory_int=|v_#memory_int_2|, ~A~0.base=v_~A~0.base_2, #length=|v_#length_2|, ~A~0.offset=v_~A~0.offset_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|, #valid=|v_#valid_2|} OutVars{~A~0.base=v_~A~0.base_2, ~A~0.offset=v_~A~0.offset_2, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_2|, #length=|v_#length_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4#1]" "[423] L58-1-->L58-2: Formula: (and (= v_~counter~0_4 |v_thread2Thread1of1ForFork1_minus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork1_#t~mem4#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_1|)) InVars {thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_3|, ~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_4, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_1|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_1|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[425] L58-2-->L58-3: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[426] L58-3-->L94: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_1|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[427] L94-->L94-1: Formula: (= |v_thread2Thread1of1ForFork1_minus_~a#1_3| |v_thread2Thread1of1ForFork1_minus_#in~a#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_3|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1]" "[428] L94-1-->L95: Formula: (= |v_thread2Thread1of1ForFork1_minus_~b#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_3|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1]" "[429] L95-->L95-1: Formula: (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[430] L95-1-->L35: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[431] L35-->L36: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[433] L36-->L35-1: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[435] L35-1-->L95-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[436] L95-2-->L96: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[437] L96-->L96-1: Formula: (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_7|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_7| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_7|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[438] L96-1-->L35-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[439] L35-2-->L36-3: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[441] L36-3-->L35-3: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[443] L35-3-->L96-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[444] L96-2-->L97: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[445] L97-->minus_returnLabel#1: Formula: (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_3| |v_thread2Thread1of1ForFork1_minus_~b#1_9|) |v_thread2Thread1of1ForFork1_minus_~a#1_9|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[446] minus_returnLabel#1-->L58-4: Formula: (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_#t~ret5#1_1|) InVars {thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[447] L58-4-->L58-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_11|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[448] L58-5-->L58-6: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[449] L58-6-->L58-7: Formula: (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_#t~ret5#1_3|) InVars {thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} OutVars{thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~tmp~1#1]" "[450] L58-7-->L58-8: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4#1]" "[451] L58-8-->L59: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[452] L59-->L59-1: Formula: (= v_~counter~0_3 |v_thread2Thread1of1ForFork1_~tmp~1#1_3|) InVars {thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_3|} OutVars{~counter~0=v_~counter~0_3, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_3|} AuxVars[] AssignedVars[~counter~0]" "[453] L59-1-->L57-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~tmp~1#1]" "[454] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork1_#t~post6#1_1| |v_thread2Thread1of1ForFork1_~i~1#1_11|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" "[455] L57-3-->L57-4: Formula: (= (+ |v_thread2Thread1of1ForFork1_#t~post6#1_3| 1) |v_thread2Thread1of1ForFork1_~i~1#1_13|) InVars {thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" "[456] L57-4-->L57-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" [2025-04-26 16:40:25,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash -218802771, now seen corresponding path program 1 times [2025-04-26 16:40:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:25,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105111605] [2025-04-26 16:40:25,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:25,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-26 16:40:25,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-26 16:40:25,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:25,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:25,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:25,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-26 16:40:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-26 16:40:25,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:25,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:25,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:25,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1102557260, now seen corresponding path program 2 times [2025-04-26 16:40:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:25,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768828307] [2025-04-26 16:40:25,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:40:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:25,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:25,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:25,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:40:25,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:25,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:25,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:25,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:25,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:25,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:25,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:25,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash 844317832, now seen corresponding path program 1 times [2025-04-26 16:40:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:40:25,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120006334] [2025-04-26 16:40:25,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:40:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:40:25,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-26 16:40:25,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-26 16:40:25,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:25,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:25,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:40:25,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-26 16:40:25,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-26 16:40:25,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:25,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:40:25,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:40:25,820 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:40:25,820 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:40:25,820 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:40:25,820 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:40:25,820 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:40:25,820 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:25,820 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:40:25,820 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:40:25,820 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_petrified1_Iteration5_Lasso [2025-04-26 16:40:25,820 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:40:25,820 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:40:25,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:25,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:40:26,499 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:40:26,499 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:40:26,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,502 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:40:26,503 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:40:26,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,516 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,520 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:40:26,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,522 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:40:26,523 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:40:26,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,535 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,541 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:40:26,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,543 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:40:26,544 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:40:26,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,557 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,562 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:40:26,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,563 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:40:26,564 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:40:26,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,579 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,585 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:40:26,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,587 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:40:26,588 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:40:26,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,610 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:40:26,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,612 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:40:26,613 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:40:26,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,625 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,631 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:40:26,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,633 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:40:26,634 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:40:26,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,647 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:40:26,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,655 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:40:26,656 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:40:26,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,668 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,674 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:40:26,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,676 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:40:26,679 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:40:26,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,692 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,699 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:40:26,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,701 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:40:26,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:40:26,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,718 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:40:26,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,726 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:40:26,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:40:26,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,742 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:40:26,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,750 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:40:26,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:40:26,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,764 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:40:26,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,773 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:40:26,774 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:40:26,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:40:26,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:40:26,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:40:26,787 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,792 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:40:26,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,796 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:40:26,797 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:40:26,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,811 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,818 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:40:26,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,820 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:40:26,820 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:40:26,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,838 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:40:26,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,848 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:40:26,848 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:40:26,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:40:26,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,871 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:40:26,871 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:40:26,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,887 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:40:26,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,894 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:40:26,898 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:40:26,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:40:26,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,913 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:40:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,921 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:40:26,921 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:40:26,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,933 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:40:26,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,945 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:40:26,945 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:40:26,962 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,969 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:40:26,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:26,971 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:40:26,972 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:40:26,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:26,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:26,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:26,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:26,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:26,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:26,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:26,986 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:40:26,991 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:40:26,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:26,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:27,012 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:40:27,013 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:40:27,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:40:27,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:40:27,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:40:27,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:40:27,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:40:27,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:40:27,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:40:27,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:40:27,051 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:40:27,051 INFO L437 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:40:27,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:40:27,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:40:27,053 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:40:27,054 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:40:27,054 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:40:27,070 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:40:27,070 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:40:27,070 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:40:27,071 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_~i~1#1, ~N~0) = -1*thread2Thread1of1ForFork1_~i~1#1 + 1*~N~0 Supporting invariants [] [2025-04-26 16:40:27,076 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:40:27,091 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-04-26 16:40:27,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:40:27,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-26 16:40:27,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-26 16:40:27,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:27,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:40:27,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:40:27,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:40:27,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:40:27,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:40:27,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:40:27,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:40:27,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:40:27,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:40:27,280 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:40:27,280 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:40:27,280 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1376 states and 1463 transitions. cyclomatic complexity: 110 Second operand has 5 states, 5 states have (on average 19.6) internal successors, (in total 98), 5 states have internal predecessors, (98), 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:40:27,335 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1376 states and 1463 transitions. cyclomatic complexity: 110. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (in total 98), 5 states have internal predecessors, (98), 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 2307 states and 2453 transitions. Complement of second has 8 states. [2025-04-26 16:40:27,335 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:40:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (in total 98), 5 states have internal predecessors, (98), 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:40:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-04-26 16:40:27,336 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 176 transitions. Stem has 67 letters. Loop has 31 letters. [2025-04-26 16:40:27,336 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:27,336 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 176 transitions. Stem has 98 letters. Loop has 31 letters. [2025-04-26 16:40:27,336 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:27,336 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 176 transitions. Stem has 67 letters. Loop has 62 letters. [2025-04-26 16:40:27,337 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:40:27,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2307 states and 2453 transitions. [2025-04-26 16:40:27,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:40:27,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2307 states to 0 states and 0 transitions. [2025-04-26 16:40:27,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:40:27,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:40:27,345 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:40:27,345 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:40:27,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:40:27,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:40:27,345 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:40:27,345 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:40:27,345 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:40:27,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:40:27,345 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:40:27,355 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:40:27,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:40:27 BoogieIcfgContainer [2025-04-26 16:40:27,356 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:40:27,356 INFO L158 Benchmark]: Toolchain (without parser) took 9158.18ms. Allocated memory was 155.2MB in the beginning and 352.3MB in the end (delta: 197.1MB). Free memory was 109.9MB in the beginning and 115.1MB in the end (delta: -5.3MB). Peak memory consumption was 189.7MB. Max. memory is 8.0GB. [2025-04-26 16:40:27,357 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:40:27,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.72ms. Allocated memory is still 155.2MB. Free memory was 109.9MB in the beginning and 95.2MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:40:27,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.25ms. Allocated memory is still 155.2MB. Free memory was 95.2MB in the beginning and 94.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:40:27,357 INFO L158 Benchmark]: Boogie Preprocessor took 28.10ms. Allocated memory is still 155.2MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:40:27,357 INFO L158 Benchmark]: RCFGBuilder took 295.28ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 76.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:40:27,357 INFO L158 Benchmark]: BuchiAutomizer took 8536.44ms. Allocated memory was 155.2MB in the beginning and 352.3MB in the end (delta: 197.1MB). Free memory was 76.2MB in the beginning and 115.1MB in the end (delta: -38.9MB). Peak memory consumption was 156.1MB. Max. memory is 8.0GB. [2025-04-26 16:40:27,358 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.14ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.72ms. Allocated memory is still 155.2MB. Free memory was 109.9MB in the beginning and 95.2MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.25ms. Allocated memory is still 155.2MB. Free memory was 95.2MB in the beginning and 94.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.10ms. Allocated memory is still 155.2MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 295.28ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 76.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 8536.44ms. Allocated memory was 155.2MB in the beginning and 352.3MB in the end (delta: 197.1MB). Free memory was 76.2MB in the beginning and 115.1MB in the end (delta: -38.9MB). Peak memory consumption was 156.1MB. 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 8.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 148 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 631 mSDsluCounter, 1957 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1381 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 257 IncrementalHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 576 mSDtfsCounter, 257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax115 hnf100 lsp74 ukn78 mio100 lsp36 div168 bol100 ite100 ukn100 eq155 hnf93 smp76 dnf146 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 5 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 431, Number of transitions in reduction automaton: 1415, Number of states in reduction automaton: 1263, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 9 locations. One deterministic module has affine ranking function (((long long) -4 * i) + 4294967289) and consists of 13 locations. One deterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:40:27,370 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...