./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test27-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/test27-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78863f43fa37191b47f0d738bb1bc2018c82b38cb68dad85c455cdbd7fd69aa4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:17:00,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:17:00,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:17:00,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:17:00,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:17:00,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:17:00,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:17:00,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:17:00,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:17:00,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:17:00,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:17:00,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:17:00,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:17:00,978 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:17:00,978 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:17:00,978 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:17:00,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:17:00,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:17:00,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:17:00,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:17:00,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:17:00,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:17:00,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:17:00,980 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:17:00,980 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78863f43fa37191b47f0d738bb1bc2018c82b38cb68dad85c455cdbd7fd69aa4 [2025-03-17 20:17:01,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:17:01,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:17:01,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:17:01,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:17:01,231 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:17:01,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-1.c [2025-03-17 20:17:02,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46388af9/e7aa43b43cd141ea8ed502abd6f71f0d/FLAG2be87b5ce [2025-03-17 20:17:02,653 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:17:02,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-1.c [2025-03-17 20:17:02,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46388af9/e7aa43b43cd141ea8ed502abd6f71f0d/FLAG2be87b5ce [2025-03-17 20:17:02,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46388af9/e7aa43b43cd141ea8ed502abd6f71f0d [2025-03-17 20:17:02,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:17:02,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:17:02,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:17:02,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:17:02,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:17:02,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:17:02" (1/1) ... [2025-03-17 20:17:02,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0467b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:02, skipping insertion in model container [2025-03-17 20:17:02,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:17:02" (1/1) ... [2025-03-17 20:17:02,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:17:03,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:17:03,105 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:17:03,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:17:03,135 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:17:03,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03 WrapperNode [2025-03-17 20:17:03,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:17:03,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:17:03,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:17:03,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:17:03,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,162 INFO L138 Inliner]: procedures = 16, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2025-03-17 20:17:03,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:17:03,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:17:03,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:17:03,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:17:03,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,194 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 4, 5, 6, 3]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 2, 2, 1]. [2025-03-17 20:17:03,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:17:03,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:17:03,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:17:03,222 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:17:03,223 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (1/1) ... [2025-03-17 20:17:03,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:03,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:03,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:03,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 20:17:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 20:17:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 20:17:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:17:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:17:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:17:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:17:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 20:17:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 20:17:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 20:17:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:17:03,360 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:17:03,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:17:03,509 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: call ULTIMATE.dealloc(main_~#cont~0#1.base, main_~#cont~0#1.offset);havoc main_~#cont~0#1.base, main_~#cont~0#1.offset;call ULTIMATE.dealloc(main_~#dummy~0#1.base, main_~#dummy~0#1.offset);havoc main_~#dummy~0#1.base, main_~#dummy~0#1.offset;call ULTIMATE.dealloc(main_~#dummies~0#1.base, main_~#dummies~0#1.offset);havoc main_~#dummies~0#1.base, main_~#dummies~0#1.offset;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-17 20:17:03,509 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: havoc check_#t~mem4#1.base, check_#t~mem4#1.offset;havoc check_#t~mem5#1.base, check_#t~mem5#1.offset;havoc check_#t~mem6#1.base, check_#t~mem6#1.offset;havoc check_#t~mem7#1; [2025-03-17 20:17:03,519 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 20:17:03,520 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:17:03,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:17:03,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:17:03,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:03 BoogieIcfgContainer [2025-03-17 20:17:03,530 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:17:03,531 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:17:03,531 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:17:03,535 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:17:03,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:03,535 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:17:02" (1/3) ... [2025-03-17 20:17:03,536 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5251464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:17:03, skipping insertion in model container [2025-03-17 20:17:03,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:03,536 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:03" (2/3) ... [2025-03-17 20:17:03,536 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5251464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:17:03, skipping insertion in model container [2025-03-17 20:17:03,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:03,536 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:03" (3/3) ... [2025-03-17 20:17:03,537 INFO L363 chiAutomizerObserver]: Analyzing ICFG test27-1.c [2025-03-17 20:17:03,572 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:17:03,572 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:17:03,573 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:17:03,573 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:17:03,573 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:17:03,573 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:17:03,573 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:17:03,573 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:17:03,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:03,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-17 20:17:03,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:03,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:03,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:03,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:17:03,589 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:17:03,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:03,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-17 20:17:03,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:03,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:03,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:03,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:17:03,594 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~post10#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~pre19#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0;" [2025-03-17 20:17:03,595 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-17 20:17:03,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2025-03-17 20:17:03,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:03,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765490015] [2025-03-17 20:17:03,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:03,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:03,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:03,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:03,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:03,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:03,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:03,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:03,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:03,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:03,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:03,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:03,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:03,708 INFO L85 PathProgramCache]: Analyzing trace with hash 55, now seen corresponding path program 1 times [2025-03-17 20:17:03,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:03,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798239064] [2025-03-17 20:17:03,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:03,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:03,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:03,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:03,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:03,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:03,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:03,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:03,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:03,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:03,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:03,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1760, now seen corresponding path program 1 times [2025-03-17 20:17:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742338837] [2025-03-17 20:17:03,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:03,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:03,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:03,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:03,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:03,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:03,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:03,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:03,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:03,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:03,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:04,415 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:17:04,416 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:17:04,416 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:17:04,416 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:17:04,416 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:17:04,416 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:04,417 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:17:04,417 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:17:04,417 INFO L132 ssoRankerPreferences]: Filename of dumped script: test27-1.c_Iteration1_Lasso [2025-03-17 20:17:04,417 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:17:04,417 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:17:04,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:04,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:05,129 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:17:05,134 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:17:05,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:17:05,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:17:05,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:17:05,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:17:05,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,247 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:17:05,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 20:17:05,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:17:05,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 20:17:05,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 20:17:05,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,313 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:17:05,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 20:17:05,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,332 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 20:17:05,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 20:17:05,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,393 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 20:17:05,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,422 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 20:17:05,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 20:17:05,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,443 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 20:17:05,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,471 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 20:17:05,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:17:05,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,496 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 20:17:05,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 20:17:05,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,529 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 20:17:05,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 20:17:05,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,556 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 20:17:05,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,579 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 20:17:05,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,603 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 20:17:05,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,627 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 20:17:05,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 20:17:05,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,649 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 20:17:05,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 20:17:05,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,670 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:17:05,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 20:17:05,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,695 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 20:17:05,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,720 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 20:17:05,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 20:17:05,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,748 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:17:05,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 20:17:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,769 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:17:05,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:05,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:05,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:05,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:05,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:05,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,793 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 20:17:05,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:05,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:05,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:05,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:05,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:05,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:05,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:05,818 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:17:05,832 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-17 20:17:05,834 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-03-17 20:17:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:05,839 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:17:05,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 20:17:05,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:17:05,857 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:17:05,857 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:17:05,858 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2025-03-17 20:17:05,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 20:17:05,925 INFO L156 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2025-03-17 20:17:05,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:17:05,933 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:17:05,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:05,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:05,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:05,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:05,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:05,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:17:05,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:05,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:05,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:05,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:05,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:05,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:17:05,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:06,012 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:17:06,013 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,036 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 21 transitions. Complement of second has 3 states. [2025-03-17 20:17:06,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:17:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 20:17:06,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2025-03-17 20:17:06,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:06,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 20:17:06,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:06,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 20:17:06,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:06,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2025-03-17 20:17:06,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:17:06,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 7 states and 9 transitions. [2025-03-17 20:17:06,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-17 20:17:06,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 20:17:06,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2025-03-17 20:17:06,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:06,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-17 20:17:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2025-03-17 20:17:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-17 20:17:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-03-17 20:17:06,064 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-17 20:17:06,064 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-17 20:17:06,064 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:17:06,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2025-03-17 20:17:06,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:17:06,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:06,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:06,065 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:17:06,065 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:17:06,066 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~post10#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~pre19#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int#3(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$#2(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$#4(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#4(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#2(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#1(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int#3(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int#3(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1;" [2025-03-17 20:17:06,066 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem18#1 := read~int#3(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem18#1;havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1;" [2025-03-17 20:17:06,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1691069, now seen corresponding path program 1 times [2025-03-17 20:17:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:06,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163729332] [2025-03-17 20:17:06,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:06,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:17:06,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:17:06,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:06,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163729332] [2025-03-17 20:17:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163729332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:06,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:17:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350722926] [2025-03-17 20:17:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:06,193 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:17:06,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-03-17 20:17:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642050178] [2025-03-17 20:17:06,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:06,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:06,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:06,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:06,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:06,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:06,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:06,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:06,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:06,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:06,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:06,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:17:06,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:17:06,239 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:06,246 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2025-03-17 20:17:06,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2025-03-17 20:17:06,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:17:06,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2025-03-17 20:17:06,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 20:17:06,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 20:17:06,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2025-03-17 20:17:06,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:06,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 20:17:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2025-03-17 20:17:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-17 20:17:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-03-17 20:17:06,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 20:17:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:17:06,250 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 20:17:06,250 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:17:06,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-03-17 20:17:06,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:17:06,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:06,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:06,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:17:06,252 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:17:06,252 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~post10#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~pre19#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int#3(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$#2(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$#4(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#4(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#2(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#1(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int#3(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int#3(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1;" [2025-03-17 20:17:06,252 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem18#1 := read~int#3(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem18#1;havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1;" [2025-03-17 20:17:06,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash 52454933, now seen corresponding path program 1 times [2025-03-17 20:17:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569671842] [2025-03-17 20:17:06,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:06,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:06,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:17:06,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:17:06,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:06,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:06,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:06,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569671842] [2025-03-17 20:17:06,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569671842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:17:06,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808149691] [2025-03-17 20:17:06,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:06,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:17:06,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:06,354 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:17:06,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:06,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-17 20:17:06,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:17:06,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:17:06,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:06,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:06,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 20:17:06,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:06,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:17:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808149691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:17:06,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:17:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 20:17:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43689582] [2025-03-17 20:17:06,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:17:06,453 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:17:06,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 2 times [2025-03-17 20:17:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:06,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539631765] [2025-03-17 20:17:06,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:17:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:06,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:06,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:06,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:17:06,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:06,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:06,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:06,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:06,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:06,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:06,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:06,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:17:06,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:17:06,485 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:06,498 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2025-03-17 20:17:06,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2025-03-17 20:17:06,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:17:06,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2025-03-17 20:17:06,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 20:17:06,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 20:17:06,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-03-17 20:17:06,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:06,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-17 20:17:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-03-17 20:17:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-17 20:17:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-03-17 20:17:06,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-17 20:17:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:17:06,500 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-17 20:17:06,500 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:17:06,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-03-17 20:17:06,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:17:06,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:06,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:06,501 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2025-03-17 20:17:06,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:17:06,501 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~post10#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~pre19#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int#3(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$#2(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$#4(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#4(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#2(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#1(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int#3(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int#3(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1;" [2025-03-17 20:17:06,501 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem18#1 := read~int#3(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem18#1;havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1;" [2025-03-17 20:17:06,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash -651615299, now seen corresponding path program 2 times [2025-03-17 20:17:06,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:06,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973617158] [2025-03-17 20:17:06,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:17:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:06,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-17 20:17:06,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:17:06,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:17:06,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:06,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973617158] [2025-03-17 20:17:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973617158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:17:06,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212352999] [2025-03-17 20:17:06,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:17:06,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:17:06,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:06,708 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:17:06,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-17 20:17:06,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-17 20:17:06,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:17:06,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:17:06,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:06,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:17:06,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:06,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:17:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:06,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212352999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:17:06,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:17:06,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 20:17:06,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407994381] [2025-03-17 20:17:06,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:17:06,892 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:17:06,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:06,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 3 times [2025-03-17 20:17:06,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564036417] [2025-03-17 20:17:06,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:17:06,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:06,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:06,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:06,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:17:06,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:06,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:06,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:06,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:06,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:06,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:06,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:06,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 20:17:06,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:17:06,925 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:06,948 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-03-17 20:17:06,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2025-03-17 20:17:06,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:17:06,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2025-03-17 20:17:06,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 20:17:06,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 20:17:06,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2025-03-17 20:17:06,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:06,949 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-03-17 20:17:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2025-03-17 20:17:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-17 20:17:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-03-17 20:17:06,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-03-17 20:17:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 20:17:06,952 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-03-17 20:17:06,952 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:17:06,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2025-03-17 20:17:06,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:17:06,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:06,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:06,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1] [2025-03-17 20:17:06,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:17:06,953 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~post10#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~pre19#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet8#1;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet9#1;call write~int#3(main_#t~nondet9#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet9#1;call write~$Pointer$#2(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int#3(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$#2(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$#4(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#4(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#2(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#1(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int#3(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int#3(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1;" [2025-03-17 20:17:06,953 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem18#1 := read~int#3(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem18#1;havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1;" [2025-03-17 20:17:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 490046653, now seen corresponding path program 3 times [2025-03-17 20:17:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900347866] [2025-03-17 20:17:06,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:17:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:06,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 6 equivalence classes. [2025-03-17 20:17:07,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:17:07,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 20:17:07,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:07,093 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:07,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:17:07,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:17:07,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:07,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:07,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:07,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 4 times [2025-03-17 20:17:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:07,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174751047] [2025-03-17 20:17:07,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:17:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:07,147 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:17:07,147 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:07,147 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:17:07,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:07,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:07,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:17:07,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:17:07,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:07,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:07,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:07,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1511568484, now seen corresponding path program 1 times [2025-03-17 20:17:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:07,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419594388] [2025-03-17 20:17:07,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:07,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:17:07,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:17:07,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:07,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:07,235 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:07,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:17:07,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:17:07,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:07,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:07,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace