/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/pthread/bigshot_s2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:15:56,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:15:56,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:15:56,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:15:56,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:15:56,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:15:56,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:15:56,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:15:56,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:15:56,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:15:56,374 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:15:56,374 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:15:56,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:15:56,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:15:56,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:15:56,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:15:56,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:15:56,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:15:56,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:15:56,376 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:15:56,376 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:15:56,376 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:15:56,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:15:56,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:15:56,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:15:56,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:15:56,610 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:15:56,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2025-04-26 18:15:57,884 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ebb79146b/3baa06df339b4748a2c7c8e5e9fc7787/FLAG462f6ccfe [2025-04-26 18:15:58,131 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:15:58,132 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2025-04-26 18:15:58,144 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ebb79146b/3baa06df339b4748a2c7c8e5e9fc7787/FLAG462f6ccfe [2025-04-26 18:15:59,084 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ebb79146b/3baa06df339b4748a2c7c8e5e9fc7787 [2025-04-26 18:15:59,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:15:59,087 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:15:59,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:15:59,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:15:59,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:15:59,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bf9b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59, skipping insertion in model container [2025-04-26 18:15:59,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:15:59,523 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2025-04-26 18:15:59,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:15:59,546 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:15:59,619 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2025-04-26 18:15:59,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:15:59,677 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:15:59,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59 WrapperNode [2025-04-26 18:15:59,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:15:59,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:15:59,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:15:59,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:15:59,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,718 INFO L138 Inliner]: procedures = 322, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2025-04-26 18:15:59,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:15:59,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:15:59,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:15:59,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:15:59,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:15:59,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:15:59,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:15:59,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:15:59,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (1/1) ... [2025-04-26 18:15:59,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:15:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:15:59,768 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 18:15:59,770 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 18:15:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-04-26 18:15:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 18:15:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:15:59,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:15:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:15:59,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:15:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 18:15:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:15:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:15:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:15:59,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:15:59,789 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 18:15:59,876 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:15:59,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:16:00,009 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:16:00,010 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:16:00,019 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:16:00,019 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:16:00,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:16:00 BoogieIcfgContainer [2025-04-26 18:16:00,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:16:00,020 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:16:00,020 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:16:00,024 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:16:00,025 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:16:00,025 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:15:59" (1/3) ... [2025-04-26 18:16:00,026 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@667ac945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:16:00, skipping insertion in model container [2025-04-26 18:16:00,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:16:00,026 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:15:59" (2/3) ... [2025-04-26 18:16:00,026 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@667ac945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:16:00, skipping insertion in model container [2025-04-26 18:16:00,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:16:00,027 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:16:00" (3/3) ... [2025-04-26 18:16:00,027 INFO L376 chiAutomizerObserver]: Analyzing ICFG bigshot_s2.i [2025-04-26 18:16:00,099 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:16:00,132 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:16:00,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:16:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:00,135 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 18:16:00,136 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 18:16:00,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 180 flow [2025-04-26 18:16:00,237 INFO L116 PetriNetUnfolderBase]: 4/79 cut-off events. [2025-04-26 18:16:00,242 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:16:00,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 4/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-04-26 18:16:00,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 83 transitions, 180 flow [2025-04-26 18:16:00,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 79 transitions, 170 flow [2025-04-26 18:16:00,249 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 82 places, 79 transitions, 170 flow [2025-04-26 18:16:00,250 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 79 transitions, 170 flow [2025-04-26 18:16:00,261 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 128 states, 126 states have (on average 1.5) internal successors, (in total 189), 127 states have internal predecessors, (189), 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 18:16:00,262 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 128 states, 126 states have (on average 1.5) internal successors, (in total 189), 127 states have internal predecessors, (189), 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 18:16:00,264 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:16:00,347 WARN L140 AmpleReduction]: Number of pruned transitions: 39 [2025-04-26 18:16:00,348 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:16:00,348 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 2 [2025-04-26 18:16:00,348 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:72 [2025-04-26 18:16:00,348 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:39 [2025-04-26 18:16:00,348 WARN L145 AmpleReduction]: Times succ was already a loop node:1 [2025-04-26 18:16:00,348 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:2 [2025-04-26 18:16:00,348 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:16:00,351 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 114 states, 112 states have (on average 1.1339285714285714) internal successors, (in total 127), 113 states have internal predecessors, (127), 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 18:16:00,356 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:16:00,356 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:16:00,356 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:16:00,357 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:16:00,357 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:16:00,357 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:16:00,357 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:16:00,357 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:16:00,359 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 1.1339285714285714) internal successors, (in total 127), 113 states have internal predecessors, (127), 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 18:16:00,376 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-04-26 18:16:00,376 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:16:00,376 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:16:00,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:16:00,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:16:00,384 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:16:00,384 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 1.1339285714285714) internal successors, (in total 127), 113 states have internal predecessors, (127), 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 18:16:00,388 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-04-26 18:16:00,388 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:16:00,388 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:16:00,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:16:00,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:16:00,398 INFO L752 eck$LassoCheckResult]: Stem: "[129] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[137] L-1-->L20: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[116] L20-->L20-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[]" "[147] L20-1-->L20-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[]" "[143] L20-2-->L20-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[171] L20-3-->L20-4: Formula: (and (= (select |v_#length_7| 2) 13) (= (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[]" "[139] L20-4-->L1116: Formula: (and (= (select |v_#length_8| 3) 8) (= (select |v_#valid_9| 3) 1)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[125] L1116-->L1116-1: Formula: (= (select (select |v_#memory_int_6| 3) 0) 66) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[108] L1116-1-->L1116-2: Formula: (= (select (select |v_#memory_int_7| 3) 1) 105) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[161] L1116-2-->L1116-3: Formula: (= (select (select |v_#memory_int_8| 3) 2) 103) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[136] L1116-3-->L1116-4: Formula: (= 115 (select (select |v_#memory_int_9| 3) 3)) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[]" "[157] L1116-4-->L1116-5: Formula: (= 104 (select (select |v_#memory_int_10| 3) 4)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[]" "[130] L1116-5-->L1116-6: Formula: (= 111 (select (select |v_#memory_int_11| 3) 5)) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[]" "[102] L1116-6-->L1116-7: Formula: (= 116 (select (select |v_#memory_int_12| 3) 6)) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[]" "[117] L1116-7-->L1116-8: Formula: (= (select (select |v_#memory_int_13| 3) 7) 0) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[]" "[126] L1116-8-->L-1-1: Formula: (and (= v_~v~0.offset_5 0) (= v_~v~0.base_5 0)) InVars {} OutVars{~v~0.offset=v_~v~0.offset_5, ~v~0.base=v_~v~0.base_5} AuxVars[] AssignedVars[~v~0.offset, ~v~0.base]" "[162] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[164] L-1-2-->L1121: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~t2~0#1]" "[134] L1121-->L1121-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[148] L1121-1-->L1122: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[124] L1122-->L1122-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1]" "[144] L1122-1-->L1122-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L1122-2-->L1122-3: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[209] L1122-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork0_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_4, thread1Thread1of1ForFork0_#t~malloc3.base=|v_thread1Thread1of1ForFork0_#t~malloc3.base_8|, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_4, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_4|, thread1Thread1of1ForFork0_#t~malloc3.offset=|v_thread1Thread1of1ForFork0_#t~malloc3.offset_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#in~arg.base, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_#t~malloc3.base, thread1Thread1of1ForFork0_~arg.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~arg.offset, thread1Thread1of1ForFork0_#t~malloc3.offset]" "[178] $Ultimate##0-->L1111: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~arg.offset_1| v_thread1Thread1of1ForFork0_~arg.offset_1) (= |v_thread1Thread1of1ForFork0_#in~arg.base_1| v_thread1Thread1of1ForFork0_~arg.base_1)) InVars {thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_1|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_1|} OutVars{thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_1|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_1|, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_1, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base]" "[179] L1111-->L1111-1: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~malloc3.offset_1| 0) (not (= |v_thread1Thread1of1ForFork0_#t~malloc3.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork0_#t~malloc3.base_1| 1)) (< |v_thread1Thread1of1ForFork0_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork0_#t~malloc3.base_1|) 0) (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork0_#t~malloc3.base_1| 8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~malloc3.offset=|v_thread1Thread1of1ForFork0_#t~malloc3.offset_1|, thread1Thread1of1ForFork0_#t~malloc3.base=|v_thread1Thread1of1ForFork0_#t~malloc3.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~malloc3.base, #valid, #length, thread1Thread1of1ForFork0_#t~malloc3.offset]" "[180] L1111-1-->L1111-2: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~malloc3.base_3| v_~v~0.base_1) (= v_~v~0.offset_1 |v_thread1Thread1of1ForFork0_#t~malloc3.offset_3|)) InVars {thread1Thread1of1ForFork0_#t~malloc3.base=|v_thread1Thread1of1ForFork0_#t~malloc3.base_3|, thread1Thread1of1ForFork0_#t~malloc3.offset=|v_thread1Thread1of1ForFork0_#t~malloc3.offset_3|} OutVars{thread1Thread1of1ForFork0_#t~malloc3.offset=|v_thread1Thread1of1ForFork0_#t~malloc3.offset_3|, ~v~0.offset=v_~v~0.offset_1, ~v~0.base=v_~v~0.base_1, thread1Thread1of1ForFork0_#t~malloc3.base=|v_thread1Thread1of1ForFork0_#t~malloc3.base_3|} AuxVars[] AssignedVars[~v~0.offset, ~v~0.base]" "[181] L1111-2-->L1112: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~malloc3.base=|v_thread1Thread1of1ForFork0_#t~malloc3.base_5|, thread1Thread1of1ForFork0_#t~malloc3.offset=|v_thread1Thread1of1ForFork0_#t~malloc3.offset_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~malloc3.base, thread1Thread1of1ForFork0_#t~malloc3.offset]" "[182] L1112-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset]" "[183] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[121] L1122-4-->L1122-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1]" "[138] L1122-5-->L1123: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[213] thread1EXIT-->L1123-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[]" "[175] L1123-1-->L1124: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1]" "[122] L1124-->L1124-1: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[131] L1124-1-->L1124-2: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_3| |v_ULTIMATE.start_main_~t2~0#1_3|) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[212] L1124-2-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_thread2Thread1of1ForFork1_#in~arg#1.base_4| 0) (= |v_thread2Thread1of1ForFork1_#in~arg#1.offset_4| 0) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre7#1_7| v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} OutVars{thread2Thread1of1ForFork1_#in~arg#1.base=|v_thread2Thread1of1ForFork1_#in~arg#1.base_4|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_14|, thread2Thread1of1ForFork1_~arg#1.base=|v_thread2Thread1of1ForFork1_~arg#1.base_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_12|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_20|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.base_8|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_12|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_14|, thread2Thread1of1ForFork1_#t~strcpy~res4#1.offset=|v_thread2Thread1of1ForFork1_#t~strcpy~res4#1.offset_4|, thread2Thread1of1ForFork1_#in~arg#1.offset=|v_thread2Thread1of1ForFork1_#in~arg#1.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|, thread2Thread1of1ForFork1_~arg#1.offset=|v_thread2Thread1of1ForFork1_~arg#1.offset_4|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_10|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_#t~strcpy~res4#1.base=|v_thread2Thread1of1ForFork1_#t~strcpy~res4#1.base_4|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.offset_8|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#in~arg#1.base, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork1_~arg#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.base, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1, thread2Thread1of1ForFork1_#t~strcpy~res4#1.offset, thread2Thread1of1ForFork1_#in~arg#1.offset, thread2Thread1of1ForFork1_~arg#1.offset, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_#t~strcpy~res4#1.base, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.offset, thread2Thread1of1ForFork1_thidvar1]" "[184] $Ultimate##0-->L1116: Formula: (and (= |v_thread2Thread1of1ForFork1_~arg#1.base_1| |v_thread2Thread1of1ForFork1_#in~arg#1.base_1|) (= |v_thread2Thread1of1ForFork1_#in~arg#1.offset_1| |v_thread2Thread1of1ForFork1_~arg#1.offset_1|)) InVars {thread2Thread1of1ForFork1_#in~arg#1.base=|v_thread2Thread1of1ForFork1_#in~arg#1.base_1|, thread2Thread1of1ForFork1_#in~arg#1.offset=|v_thread2Thread1of1ForFork1_#in~arg#1.offset_1|} OutVars{thread2Thread1of1ForFork1_#in~arg#1.base=|v_thread2Thread1of1ForFork1_#in~arg#1.base_1|, thread2Thread1of1ForFork1_~arg#1.offset=|v_thread2Thread1of1ForFork1_~arg#1.offset_1|, thread2Thread1of1ForFork1_~arg#1.base=|v_thread2Thread1of1ForFork1_~arg#1.base_1|, thread2Thread1of1ForFork1_#in~arg#1.offset=|v_thread2Thread1of1ForFork1_#in~arg#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~arg#1.base, thread2Thread1of1ForFork1_~arg#1.offset]" "[185] L1116-->L1116-1: Formula: (or (not (= v_~v~0.offset_3 0)) (not (= v_~v~0.base_3 0))) InVars {~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} OutVars{~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[]" "[187] L1116-1-->L1116-2: Formula: (and (= |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_1| 0) (= 3 |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_1|) (= |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_1| v_~v~0.base_4) (= |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_1| v_~v~0.offset_4)) InVars {~v~0.offset=v_~v~0.offset_4, ~v~0.base=v_~v~0.base_4} OutVars{thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_1|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_1|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_1|, ~v~0.offset=v_~v~0.offset_4, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_1|, ~v~0.base=v_~v~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base]" "[189] L1116-2-->L1116-3: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.base_1|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.base, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#res#1.offset]" "[191] L1116-3-->L-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_1|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1]" "[192] L-1-->L-1-10: Formula: (= |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_3| 0) InVars {} OutVars{thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1]" [2025-04-26 18:16:00,399 INFO L754 eck$LassoCheckResult]: Loop: "[194] L-1-10-->L-1-2: Formula: (= (select |v_#valid_3| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_3|) 1) InVars {#valid=|v_#valid_3|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_3|} OutVars{#valid=|v_#valid_3|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_3|} AuxVars[] AssignedVars[]" "[196] L-1-2-->L-1-3: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_5| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_3|))) (and (< .cse0 (select |v_#length_3| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_5|)) (<= 0 .cse0))) InVars {#length=|v_#length_3|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_3|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_5|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_5|} OutVars{#length=|v_#length_3|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_3|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_5|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_5|} AuxVars[] AssignedVars[]" "[198] L-1-3-->L-1-4: Formula: (= (select |v_#valid_4| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_5|) 1) InVars {thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_5|, #valid=|v_#valid_4|} OutVars{thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[200] L-1-4-->L-1-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_5| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_9|))) (and (< .cse0 (select |v_#length_4| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_7|)) (<= 0 .cse0))) InVars {#length=|v_#length_4|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_7|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_9|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_5|} OutVars{#length=|v_#length_4|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_7|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_9|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_5|} AuxVars[] AssignedVars[]" "[202] L-1-5-->L-1-6: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_11| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_7|))) (and (= |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_5| (select (select |v_#memory_int_1| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_9|) .cse0)) (<= 0 .cse0) (= (select |v_#valid_5| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_9|) 1) (<= (+ |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_11| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_7| 1) (select |v_#length_5| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_9|)))) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_5|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_7|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_9|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_11|, #valid=|v_#valid_5|} OutVars{thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_5|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base_9|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset_7|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1]" "[203] L-1-6-->L-1-7: Formula: (= (store |v_#memory_int_3| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_11| (store (select |v_#memory_int_3| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_11|) (+ |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_9| |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_13|) |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_7|)) |v_#memory_int_2|) InVars {#memory_int=|v_#memory_int_3|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_11|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_13|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_9|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_7|} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base_11|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_13|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset_9|, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_7|} AuxVars[] AssignedVars[#memory_int]" "[205] L-1-7-->L-1-9: Formula: (not (= |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_11| 0)) InVars {thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_11|} OutVars{thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~mem12#1_11|} AuxVars[] AssignedVars[]" "[206] L-1-9-->L-1-10: Formula: (= |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_16| (+ |v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_15| 1)) InVars {thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_15|} OutVars{thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1=|v_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1_16|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1]" [2025-04-26 18:16:00,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1395658947, now seen corresponding path program 1 times [2025-04-26 18:16:00,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:00,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609197689] [2025-04-26 18:16:00,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:00,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:00,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:16:00,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:16:00,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:00,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:00,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:00,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:16:00,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:16:00,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:00,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:00,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:00,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash 711892007, now seen corresponding path program 1 times [2025-04-26 18:16:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:00,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167515438] [2025-04-26 18:16:00,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:00,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:16:00,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:16:00,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:00,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:00,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:00,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:16:00,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:16:00,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:00,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:00,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:00,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1005162339, now seen corresponding path program 1 times [2025-04-26 18:16:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:00,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281240792] [2025-04-26 18:16:00,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:00,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 18:16:00,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 18:16:00,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:00,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:00,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:00,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 18:16:00,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 18:16:00,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:00,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:00,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:01,551 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:16:01,552 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:16:01,552 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:16:01,552 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:16:01,552 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:16:01,552 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:01,553 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:16:01,553 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:16:01,553 INFO L132 ssoRankerPreferences]: Filename of dumped script: bigshot_s2.i_petrified1_Iteration1_Lasso [2025-04-26 18:16:01,553 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:16:01,553 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:16:01,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:01,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:16:02,836 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:16:02,839 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:16:02,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:02,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:02,842 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 18:16:02,844 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 18:16:02,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:02,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:02,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:16:02,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:02,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:02,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:02,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:16:02,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:16:02,868 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:02,874 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 18:16:02,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:02,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:02,876 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 18:16:02,877 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 18:16:02,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:02,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:02,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:16:02,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:02,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:02,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:02,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:16:02,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:16:02,891 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:02,896 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 18:16:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:02,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:02,898 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 18:16:02,900 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 18:16:02,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:02,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:02,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:02,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:02,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:02,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:02,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:02,919 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:02,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:16:02,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:02,926 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 18:16:02,927 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 18:16:02,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:02,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:02,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:02,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:02,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:02,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:02,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:02,942 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:02,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:16:02,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:02,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:02,952 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 18:16:02,954 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 18:16:02,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:02,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:02,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:16:02,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:02,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:02,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:02,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:16:02,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:16:02,966 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:02,972 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 18:16:02,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:02,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:02,974 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 18:16:02,976 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 18:16:02,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:02,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:02,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:02,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:02,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:02,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:02,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:02,997 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:16:03,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,005 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 18:16:03,006 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 18:16:03,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,024 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:16:03,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,031 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 18:16:03,031 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 18:16:03,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,046 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:16:03,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,054 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 18:16:03,055 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 18:16:03,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,070 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,076 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 18:16:03,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,078 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 18:16:03,079 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 18:16:03,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:16:03,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:16:03,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:16:03,092 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:16:03,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,100 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 18:16:03,100 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 18:16:03,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:16:03,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:16:03,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:16:03,113 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,118 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 18:16:03,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,120 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 18:16:03,121 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 18:16:03,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,136 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,143 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 18:16:03,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,146 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 18:16:03,147 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 18:16:03,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,165 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,171 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 18:16:03,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,172 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 18:16:03,173 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 18:16:03,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,190 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,195 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 18:16:03,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,197 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 18:16:03,198 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 18:16:03,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,216 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:16:03,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,223 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 18:16:03,226 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 18:16:03,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,247 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,253 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 18:16:03,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,255 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 18:16:03,257 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 18:16:03,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,274 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,280 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 18:16:03,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,282 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 18:16:03,283 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 18:16:03,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,300 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,306 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 18:16:03,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,308 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 18:16:03,309 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 18:16:03,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:16:03,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,321 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:16:03,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,324 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:16:03,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,329 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:16:03,335 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 18:16:03,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,337 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 18:16:03,338 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 18:16:03,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 18:16:03,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:16:03,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:16:03,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:16:03,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:16:03,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:16:03,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:16:03,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:16:03,409 INFO L436 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2025-04-26 18:16:03,409 INFO L437 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-04-26 18:16:03,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:16:03,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:03,413 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 18:16:03,414 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 18:16:03,415 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:16:03,432 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 18:16:03,433 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:16:03,433 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:16:03,433 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length 3)_1, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset, thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1) = 1*v_rep(select #length 3)_1 - 1*thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset - 1*thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset11#1 Supporting invariants [] [2025-04-26 18:16:03,440 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 18:16:03,496 INFO L156 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2025-04-26 18:16:03,505 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #Ultimate.C_strcpy_dest#1.offset [2025-04-26 18:16:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 18:16:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 18:16:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~offset11 [2025-04-26 18:16:03,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:03,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:16:03,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:16:03,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:03,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:16:03,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 18:16:03,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:16:03,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:16:03,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:16:03,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:03,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:16:03,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 18:16:03,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:16:03,802 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 18:16:03,821 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-04-26 18:16:03,823 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 1.1339285714285714) internal successors, (in total 127), 113 states have internal predecessors, (127), 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 7 states, 7 states have (on average 7.285714285714286) internal successors, (in total 51), 7 states have internal predecessors, (51), 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 18:16:03,962 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 1.1339285714285714) internal successors, (in total 127), 113 states have internal predecessors, (127), 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 7 states, 7 states have (on average 7.285714285714286) internal successors, (in total 51), 7 states have internal predecessors, (51), 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 203 states and 220 transitions. Complement of second has 11 states. [2025-04-26 18:16:03,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:16:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (in total 51), 7 states have internal predecessors, (51), 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 18:16:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-04-26 18:16:03,971 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 105 transitions. Stem has 43 letters. Loop has 8 letters. [2025-04-26 18:16:03,972 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:16:03,972 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 105 transitions. Stem has 51 letters. Loop has 8 letters. [2025-04-26 18:16:03,972 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:16:03,972 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 105 transitions. Stem has 43 letters. Loop has 16 letters. [2025-04-26 18:16:03,973 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:16:03,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 220 transitions. [2025-04-26 18:16:03,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:16:03,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 0 states and 0 transitions. [2025-04-26 18:16:03,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:16:03,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:16:03,981 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:16:03,981 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:16:03,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:16:03,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:16:03,981 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:16:03,981 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:16:03,982 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:16:03,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:16:03,982 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:16:03,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:16:03,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:16:03 BoogieIcfgContainer [2025-04-26 18:16:03,992 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:16:03,992 INFO L158 Benchmark]: Toolchain (without parser) took 4904.91ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 105.8MB in the beginning and 205.3MB in the end (delta: -99.5MB). Peak memory consumption was 117.8MB. Max. memory is 8.0GB. [2025-04-26 18:16:03,992 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 167.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:16:03,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.43ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 71.7MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-26 18:16:03,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.43ms. Allocated memory is still 155.2MB. Free memory was 71.1MB in the beginning and 68.9MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:16:03,993 INFO L158 Benchmark]: Boogie Preprocessor took 23.06ms. Allocated memory is still 155.2MB. Free memory was 68.9MB in the beginning and 67.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:16:03,993 INFO L158 Benchmark]: RCFGBuilder took 275.24ms. Allocated memory is still 155.2MB. Free memory was 67.5MB in the beginning and 54.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:16:03,993 INFO L158 Benchmark]: BuchiAutomizer took 3971.47ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 54.1MB in the beginning and 205.3MB in the end (delta: -151.2MB). Peak memory consumption was 67.4MB. Max. memory is 8.0GB. [2025-04-26 18:16:03,994 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.80ms. Allocated memory is still 167.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 589.43ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 71.7MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.43ms. Allocated memory is still 155.2MB. Free memory was 71.1MB in the beginning and 68.9MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.06ms. Allocated memory is still 155.2MB. Free memory was 68.9MB in the beginning and 67.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 275.24ms. Allocated memory is still 155.2MB. Free memory was 67.5MB in the beginning and 54.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3971.47ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 54.1MB in the beginning and 205.3MB in the end (delta: -151.2MB). Peak memory consumption was 67.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #Ultimate.C_strcpy_dest#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~offset11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 63 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital282 mio100 ax183 hnf100 lsp42 ukn95 mio100 lsp27 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 221, Number of transitions in reduction automaton: 127, Number of states in reduction automaton: 114, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 8 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:16:04,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...