./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.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 bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:14:53,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:14:53,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:14:53,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:14:53,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:14:53,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:14:53,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:14:53,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:14:53,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:14:53,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:14:53,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:14:53,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:14:53,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:14:53,832 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:14:53,832 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:14:53,832 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:14:53,833 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:14:53,833 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:14:53,833 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:14:53,834 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:14:53,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:14:53,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:14:53,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:14:53,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:14:53,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:14:53,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:14:53,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:14:53,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:14:53,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:14:53,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:14:53,840 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:14:53,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:14:53,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:14:53,841 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:14:53,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:14:53,841 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:14:53,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:14:53,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:14:53,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:14:53,842 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:14:53,843 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2024-11-17 08:14:54,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:14:54,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:14:54,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:14:54,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:14:54,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:14:54,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2024-11-17 08:14:55,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:14:55,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:14:55,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2024-11-17 08:14:55,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3674753d1/72947a0048cc4b06a318143aaddcf138/FLAGe43d96a63 [2024-11-17 08:14:55,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3674753d1/72947a0048cc4b06a318143aaddcf138 [2024-11-17 08:14:55,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:14:55,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:14:55,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:14:55,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:14:55,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:14:55,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:14:55" (1/1) ... [2024-11-17 08:14:55,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240ca45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:55, skipping insertion in model container [2024-11-17 08:14:55,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:14:55" (1/1) ... [2024-11-17 08:14:55,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:14:55,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:14:55,999 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:14:56,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:14:56,030 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:14:56,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56 WrapperNode [2024-11-17 08:14:56,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:14:56,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:14:56,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:14:56,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:14:56,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,060 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2024-11-17 08:14:56,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:14:56,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:14:56,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:14:56,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:14:56,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,083 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-17 08:14:56,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:14:56,093 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:14:56,093 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:14:56,093 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:14:56,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (1/1) ... [2024-11-17 08:14:56,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:56,152 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) [2024-11-17 08:14:56,155 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 [2024-11-17 08:14:56,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:14:56,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:14:56,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:14:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:14:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:14:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:14:56,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:14:56,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:14:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:14:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:14:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:14:56,291 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:14:56,295 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:14:56,435 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: call ULTIMATE.dealloc(main_~#in~0#1.base, main_~#in~0#1.offset);havoc main_~#in~0#1.base, main_~#in~0#1.offset; [2024-11-17 08:14:56,445 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-17 08:14:56,445 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:14:56,455 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:14:56,456 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:14:56,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:14:56 BoogieIcfgContainer [2024-11-17 08:14:56,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:14:56,458 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:14:56,458 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:14:56,462 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:14:56,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:14:56,463 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:14:55" (1/3) ... [2024-11-17 08:14:56,463 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aaf63b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:14:56, skipping insertion in model container [2024-11-17 08:14:56,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:14:56,464 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:56" (2/3) ... [2024-11-17 08:14:56,464 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aaf63b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:14:56, skipping insertion in model container [2024-11-17 08:14:56,464 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:14:56,464 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:14:56" (3/3) ... [2024-11-17 08:14:56,465 INFO L332 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2024-11-17 08:14:56,508 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:14:56,508 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:14:56,508 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:14:56,509 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:14:56,509 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:14:56,509 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:14:56,509 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:14:56,509 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:14:56,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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) [2024-11-17 08:14:56,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-17 08:14:56,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:56,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:56,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:14:56,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:14:56,532 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:14:56,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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) [2024-11-17 08:14:56,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-17 08:14:56,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:56,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:56,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:14:56,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:14:56,539 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue 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(39, 2);call #Ultimate.allocInit(12, 3); 9#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 10#L21true [2024-11-17 08:14:56,540 INFO L747 eck$LassoCheckResult]: Loop: 10#L21true assume true; 15#L21-1true assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10#L21true [2024-11-17 08:14:56,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 1 times [2024-11-17 08:14:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:56,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162914269] [2024-11-17 08:14:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:56,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:56,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:56,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:56,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1632, now seen corresponding path program 1 times [2024-11-17 08:14:56,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:56,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028089998] [2024-11-17 08:14:56,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:56,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:56,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:56,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1661279, now seen corresponding path program 1 times [2024-11-17 08:14:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376589645] [2024-11-17 08:14:56,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:56,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:56,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:57,148 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:14:57,149 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:14:57,149 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:14:57,149 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:14:57,149 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:14:57,150 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,150 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:14:57,150 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:14:57,151 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2024-11-17 08:14:57,151 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:14:57,151 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:14:57,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:57,667 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:14:57,671 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:14:57,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:57,676 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) [2024-11-17 08:14:57,678 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 [2024-11-17 08:14:57,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:57,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:57,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:14:57,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:57,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:57,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:57,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:14:57,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:14:57,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:57,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:14:57,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:57,722 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) [2024-11-17 08:14:57,724 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 [2024-11-17 08:14:57,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:57,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:57,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:14:57,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:57,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:57,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:57,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:14:57,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:14:57,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:57,760 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 [2024-11-17 08:14:57,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:57,762 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) [2024-11-17 08:14:57,764 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 [2024-11-17 08:14:57,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:57,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:57,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:14:57,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:57,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:57,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:57,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:14:57,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:14:57,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:57,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:14:57,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:57,805 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) [2024-11-17 08:14:57,807 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 [2024-11-17 08:14:57,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:57,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:57,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:57,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:57,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:57,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:57,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:57,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:57,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:14:57,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:57,846 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) [2024-11-17 08:14:57,848 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 [2024-11-17 08:14:57,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:57,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:57,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:57,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:57,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:57,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:57,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:57,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:57,888 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 [2024-11-17 08:14:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:57,891 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) [2024-11-17 08:14:57,903 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 [2024-11-17 08:14:57,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:57,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:57,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:57,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:57,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:57,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:57,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:57,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:57,942 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 [2024-11-17 08:14:57,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:57,944 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) [2024-11-17 08:14:57,945 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 [2024-11-17 08:14:57,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:57,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:57,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:14:57,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:57,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:57,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:57,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:14:57,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:14:57,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:57,973 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 [2024-11-17 08:14:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:57,974 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) [2024-11-17 08:14:57,975 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 [2024-11-17 08:14:57,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:57,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:57,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:57,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:57,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:57,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:57,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:57,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:58,014 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 [2024-11-17 08:14:58,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:58,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:58,017 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) [2024-11-17 08:14:58,018 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 [2024-11-17 08:14:58,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:58,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:58,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:58,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:58,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:58,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:58,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:58,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:14:58,079 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-17 08:14:58,079 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:14:58,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:58,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:58,104 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) [2024-11-17 08:14:58,107 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 [2024-11-17 08:14:58,107 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:14:58,124 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:14:58,125 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:14:58,125 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_1) = -2*ULTIMATE.start_main_~i~0#1 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_1 Supporting invariants [] [2024-11-17 08:14:58,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:58,161 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-17 08:14:58,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:14:58,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:14:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:58,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:14:58,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:58,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:14:58,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:58,263 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 [2024-11-17 08:14:58,265 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2024-11-17 08:14:58,291 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) Result 28 states and 36 transitions. Complement of second has 6 states. [2024-11-17 08:14:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:14:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2024-11-17 08:14:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-17 08:14:58,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-17 08:14:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-17 08:14:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-17 08:14:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:58,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2024-11-17 08:14:58,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:14:58,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 11 transitions. [2024-11-17 08:14:58,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-17 08:14:58,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-17 08:14:58,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2024-11-17 08:14:58,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:58,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-17 08:14:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2024-11-17 08:14:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-17 08:14:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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) [2024-11-17 08:14:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-17 08:14:58,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-17 08:14:58,328 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-17 08:14:58,329 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:14:58,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-17 08:14:58,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:14:58,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:58,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:58,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:14:58,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:14:58,333 INFO L745 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY 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(39, 2);call #Ultimate.allocInit(12, 3); 99#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 100#L21 assume true; 104#L21-1 assume !(main_~i~0#1 < 11); 106#L23 call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 102#L28 [2024-11-17 08:14:58,334 INFO L747 eck$LassoCheckResult]: Loop: 102#L28 assume true; 101#L28-1 assume !!(48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57);main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 102#L28 [2024-11-17 08:14:58,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash 51499603, now seen corresponding path program 1 times [2024-11-17 08:14:58,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:58,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630106665] [2024-11-17 08:14:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:58,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:58,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:58,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630106665] [2024-11-17 08:14:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630106665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:14:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:14:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:14:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053229465] [2024-11-17 08:14:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:14:58,449 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:14:58,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:58,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 1 times [2024-11-17 08:14:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:58,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435735085] [2024-11-17 08:14:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:58,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:58,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:14:58,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:14:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:14:58,634 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-17 08:14:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:14:58,646 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-17 08:14:58,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-17 08:14:58,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:14:58,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2024-11-17 08:14:58,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:14:58,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:14:58,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-11-17 08:14:58,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:58,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-17 08:14:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-11-17 08:14:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2024-11-17 08:14:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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) [2024-11-17 08:14:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-17 08:14:58,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-17 08:14:58,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:14:58,652 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-17 08:14:58,653 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:14:58,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-17 08:14:58,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:14:58,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:58,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:58,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-17 08:14:58,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:14:58,655 INFO L745 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY 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(39, 2);call #Ultimate.allocInit(12, 3); 127#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 128#L21 assume true; 129#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 130#L21 assume true; 131#L21-1 assume !(main_~i~0#1 < 11); 134#L23 call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 133#L28 [2024-11-17 08:14:58,655 INFO L747 eck$LassoCheckResult]: Loop: 133#L28 assume true; 132#L28-1 assume !!(48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57);main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 133#L28 [2024-11-17 08:14:58,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2048424108, now seen corresponding path program 1 times [2024-11-17 08:14:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:58,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235067055] [2024-11-17 08:14:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:58,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:58,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235067055] [2024-11-17 08:14:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235067055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:14:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393650508] [2024-11-17 08:14:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:58,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:14:58,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:58,744 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:14:58,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 08:14:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:58,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:14:58,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:58,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:14:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393650508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:14:58,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:14:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 08:14:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068083782] [2024-11-17 08:14:58,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:14:58,844 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:14:58,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 2 times [2024-11-17 08:14:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:58,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071221927] [2024-11-17 08:14:58,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:58,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:58,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:58,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:14:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:14:58,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:14:58,976 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) [2024-11-17 08:14:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:14:59,000 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-17 08:14:59,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2024-11-17 08:14:59,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:14:59,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 21 transitions. [2024-11-17 08:14:59,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-17 08:14:59,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-17 08:14:59,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2024-11-17 08:14:59,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:59,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-17 08:14:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2024-11-17 08:14:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2024-11-17 08:14:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 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) [2024-11-17 08:14:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-17 08:14:59,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-17 08:14:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:14:59,005 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-17 08:14:59,005 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:14:59,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2024-11-17 08:14:59,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:14:59,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:59,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:59,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1] [2024-11-17 08:14:59,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:14:59,007 INFO L745 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY 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(39, 2);call #Ultimate.allocInit(12, 3); 205#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 206#L21 assume true; 207#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 208#L21 assume true; 209#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 218#L21 assume true; 217#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 216#L21 assume true; 215#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 214#L21 assume true; 213#L21-1 assume !(main_~i~0#1 < 11); 212#L23 call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 211#L28 [2024-11-17 08:14:59,007 INFO L747 eck$LassoCheckResult]: Loop: 211#L28 assume true; 210#L28-1 assume !!(48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57);main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 211#L28 [2024-11-17 08:14:59,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:59,007 INFO L85 PathProgramCache]: Analyzing trace with hash -49972009, now seen corresponding path program 2 times [2024-11-17 08:14:59,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:59,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055636858] [2024-11-17 08:14:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:59,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:59,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:59,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055636858] [2024-11-17 08:14:59,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055636858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:14:59,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136103871] [2024-11-17 08:14:59,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:14:59,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:14:59,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:59,140 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:14:59,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-17 08:14:59,205 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:14:59,205 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:14:59,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:14:59,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:59,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:14:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:59,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136103871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:14:59,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:14:59,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 08:14:59,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652616350] [2024-11-17 08:14:59,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:14:59,309 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:14:59,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 3 times [2024-11-17 08:14:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:59,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512327334] [2024-11-17 08:14:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:59,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:59,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:59,353 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 [2024-11-17 08:14:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:14:59,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:14:59,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:14:59,453 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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) [2024-11-17 08:14:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:14:59,485 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-11-17 08:14:59,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2024-11-17 08:14:59,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:14:59,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 32 states and 33 transitions. [2024-11-17 08:14:59,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-17 08:14:59,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-17 08:14:59,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 33 transitions. [2024-11-17 08:14:59,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:59,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-17 08:14:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 33 transitions. [2024-11-17 08:14:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-11-17 08:14:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 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) [2024-11-17 08:14:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-17 08:14:59,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-17 08:14:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:14:59,490 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-17 08:14:59,491 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:14:59,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2024-11-17 08:14:59,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:14:59,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:59,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:59,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1] [2024-11-17 08:14:59,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:14:59,492 INFO L745 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY 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(39, 2);call #Ultimate.allocInit(12, 3); 346#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 347#L21 assume true; 348#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 349#L21 assume true; 350#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 355#L21 assume true; 371#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 370#L21 assume true; 369#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 368#L21 assume true; 367#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 366#L21 assume true; 365#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 364#L21 assume true; 363#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 362#L21 assume true; 361#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 360#L21 assume true; 359#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 358#L21 assume true; 357#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 356#L21 assume true; 354#L21-1 assume !(main_~i~0#1 < 11); 353#L23 call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 352#L28 [2024-11-17 08:14:59,492 INFO L747 eck$LassoCheckResult]: Loop: 352#L28 assume true; 351#L28-1 assume !!(48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57);main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 352#L28 [2024-11-17 08:14:59,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:59,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2026556701, now seen corresponding path program 3 times [2024-11-17 08:14:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959993678] [2024-11-17 08:14:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:59,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:59,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959993678] [2024-11-17 08:14:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959993678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:14:59,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147244446] [2024-11-17 08:14:59,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:14:59,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:14:59,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:59,720 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:14:59,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 08:14:59,832 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-17 08:14:59,833 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:14:59,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:14:59,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:59,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:15:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147244446] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:15:00,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:15:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 14 [2024-11-17 08:15:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013492867] [2024-11-17 08:15:00,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:15:00,010 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:15:00,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 4 times [2024-11-17 08:15:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:00,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149495409] [2024-11-17 08:15:00,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:00,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:00,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:00,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:00,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 08:15:00,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2024-11-17 08:15:00,125 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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) [2024-11-17 08:15:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:00,151 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-11-17 08:15:00,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2024-11-17 08:15:00,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:15:00,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 35 transitions. [2024-11-17 08:15:00,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-17 08:15:00,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-17 08:15:00,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 35 transitions. [2024-11-17 08:15:00,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:15:00,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-17 08:15:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 35 transitions. [2024-11-17 08:15:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2024-11-17 08:15:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 28 states have internal predecessors, (30), 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) [2024-11-17 08:15:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-17 08:15:00,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-17 08:15:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 08:15:00,163 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-17 08:15:00,163 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:15:00,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 30 transitions. [2024-11-17 08:15:00,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:15:00,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:00,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:00,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 1, 1, 1, 1] [2024-11-17 08:15:00,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:15:00,166 INFO L745 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY 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(39, 2);call #Ultimate.allocInit(12, 3); 569#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 570#L21 assume true; 571#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 572#L21 assume true; 573#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 578#L21 assume true; 596#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 595#L21 assume true; 594#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 593#L21 assume true; 592#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 591#L21 assume true; 590#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 589#L21 assume true; 588#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 587#L21 assume true; 586#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 585#L21 assume true; 584#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 583#L21 assume true; 582#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 581#L21 assume true; 580#L21-1 assume !!(main_~i~0#1 < 11);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 579#L21 assume true; 577#L21-1 assume !(main_~i~0#1 < 11); 576#L23 call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 575#L28 [2024-11-17 08:15:00,166 INFO L747 eck$LassoCheckResult]: Loop: 575#L28 assume true; 574#L28-1 assume !!(48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57);main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 575#L28 [2024-11-17 08:15:00,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1900869534, now seen corresponding path program 4 times [2024-11-17 08:15:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:00,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48758532] [2024-11-17 08:15:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:00,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:00,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 5 times [2024-11-17 08:15:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316515010] [2024-11-17 08:15:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:00,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:00,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:00,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:00,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1374521821, now seen corresponding path program 1 times [2024-11-17 08:15:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491738976] [2024-11-17 08:15:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:00,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:00,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:07,572 WARN L286 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 234 DAG size of output: 180 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-17 08:15:08,311 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:15:08,311 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:15:08,311 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:15:08,311 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:15:08,311 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:15:08,311 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:08,312 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:15:08,312 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:15:08,312 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration6_Lasso [2024-11-17 08:15:08,312 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:15:08,312 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:15:08,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:08,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:08,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:08,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:08,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:09,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:09,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:09,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:09,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:09,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:09,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:15:09,477 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:15:09,478 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:15:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,480 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) [2024-11-17 08:15:09,485 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 [2024-11-17 08:15:09,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:15:09,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:15:09,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:15:09,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,517 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 [2024-11-17 08:15:09,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,519 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) [2024-11-17 08:15:09,520 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 [2024-11-17 08:15:09,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:15:09,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:15:09,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:15:09,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,552 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 [2024-11-17 08:15:09,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,555 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) [2024-11-17 08:15:09,556 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 [2024-11-17 08:15:09,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:15:09,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:15:09,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,592 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 [2024-11-17 08:15:09,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,595 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) [2024-11-17 08:15:09,599 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 [2024-11-17 08:15:09,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:15:09,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:15:09,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:15:09,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,635 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) [2024-11-17 08:15:09,636 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 [2024-11-17 08:15:09,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:15:09,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:15:09,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:15:09,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,660 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 [2024-11-17 08:15:09,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,662 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) [2024-11-17 08:15:09,664 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 [2024-11-17 08:15:09,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:15:09,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:15:09,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,695 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 [2024-11-17 08:15:09,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,697 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) [2024-11-17 08:15:09,699 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 [2024-11-17 08:15:09,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:15:09,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:15:09,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:15:09,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,736 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) [2024-11-17 08:15:09,737 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 [2024-11-17 08:15:09,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,748 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:15:09,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,764 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-17 08:15:09,764 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:15:09,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:15:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,807 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) [2024-11-17 08:15:09,808 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 [2024-11-17 08:15:09,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:15:09,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:15:09,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:15:09,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-17 08:15:09,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,841 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) [2024-11-17 08:15:09,842 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 [2024-11-17 08:15:09,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:15:09,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:15:09,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:15:09,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:15:09,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,875 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) [2024-11-17 08:15:09,876 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 [2024-11-17 08:15:09,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:15:09,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:15:09,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:15:09,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:15:09,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:15:09,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:15:09,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:15:09,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:15:09,918 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-17 08:15:09,918 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:15:09,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:09,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:09,920 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) [2024-11-17 08:15:09,923 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 [2024-11-17 08:15:09,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:15:09,936 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:15:09,936 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:15:09,936 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~idx_in~0#1, ULTIMATE.start_main_~#in~0#1.offset, v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_2) = -1*ULTIMATE.start_main_~idx_in~0#1 - 1*ULTIMATE.start_main_~#in~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_2 Supporting invariants [] [2024-11-17 08:15:09,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:15:09,968 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-17 08:15:09,970 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:15:09,970 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:15:09,971 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#in~0!offset [2024-11-17 08:15:09,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:10,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:15:10,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:15:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:10,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:15:10,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:15:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:10,078 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 [2024-11-17 08:15:10,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 30 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2024-11-17 08:15:10,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 30 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 31 states and 33 transitions. Complement of second has 4 states. [2024-11-17 08:15:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:15:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2024-11-17 08:15:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-17 08:15:10,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-17 08:15:10,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:15:10,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 29 letters. Loop has 2 letters. [2024-11-17 08:15:10,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:15:10,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 27 letters. Loop has 4 letters. [2024-11-17 08:15:10,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:15:10,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2024-11-17 08:15:10,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:15:10,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2024-11-17 08:15:10,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:15:10,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:15:10,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:15:10,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:10,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:15:10,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:15:10,091 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:15:10,091 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:15:10,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:15:10,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:15:10,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:15:10,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:15:10 BoogieIcfgContainer [2024-11-17 08:15:10,101 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:15:10,102 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:15:10,102 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:15:10,102 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:15:10,103 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:14:56" (3/4) ... [2024-11-17 08:15:10,106 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:15:10,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:15:10,108 INFO L158 Benchmark]: Toolchain (without parser) took 14315.26ms. Allocated memory was 132.1MB in the beginning and 205.5MB in the end (delta: 73.4MB). Free memory was 77.4MB in the beginning and 64.5MB in the end (delta: 12.9MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2024-11-17 08:15:10,108 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 132.1MB. Free memory was 92.9MB in the beginning and 92.7MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:10,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.96ms. Allocated memory is still 132.1MB. Free memory was 77.1MB in the beginning and 64.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:15:10,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.38ms. Allocated memory is still 132.1MB. Free memory was 64.9MB in the beginning and 63.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:15:10,110 INFO L158 Benchmark]: Boogie Preprocessor took 31.43ms. Allocated memory is still 132.1MB. Free memory was 63.3MB in the beginning and 61.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:10,110 INFO L158 Benchmark]: IcfgBuilder took 363.32ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 61.6MB in the beginning and 133.3MB in the end (delta: -71.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-17 08:15:10,110 INFO L158 Benchmark]: BuchiAutomizer took 13643.12ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 133.3MB in the beginning and 64.5MB in the end (delta: 68.8MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2024-11-17 08:15:10,111 INFO L158 Benchmark]: Witness Printer took 5.21ms. Allocated memory is still 205.5MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:10,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 132.1MB. Free memory was 92.9MB in the beginning and 92.7MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.96ms. Allocated memory is still 132.1MB. Free memory was 77.1MB in the beginning and 64.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.38ms. Allocated memory is still 132.1MB. Free memory was 64.9MB in the beginning and 63.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.43ms. Allocated memory is still 132.1MB. Free memory was 63.3MB in the beginning and 61.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 363.32ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 61.6MB in the beginning and 133.3MB in the end (delta: -71.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 13643.12ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 133.3MB in the beginning and 64.5MB in the end (delta: 68.8MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. * Witness Printer took 5.21ms. Allocated memory is still 205.5MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#in~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.5s and 7 iterations. TraceHistogramMax:12. Analysis of lassos took 13.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 34 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax100 hnf100 lsp100 ukn60 mio100 lsp41 div131 bol100 ite100 ukn100 eq157 hnf93 smp77 dnf193 smp75 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 4 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:15:10,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-17 08:15:10,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:15:10,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:15:10,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-17 08:15:10,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE