./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/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/reducercommutativity/rangesum05.i -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.graphml --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 0bbcd29b379466a58e055ac550736cd77ce56d9c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 05:18:43,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 05:18:43,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 05:18:43,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 05:18:43,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 05:18:43,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 05:18:43,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 05:18:43,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 05:18:43,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 05:18:43,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 05:18:43,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 05:18:43,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 05:18:43,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 05:18:43,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 05:18:43,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 05:18:43,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 05:18:43,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 05:18:43,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 05:18:43,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 05:18:43,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 05:18:43,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 05:18:43,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 05:18:43,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 05:18:43,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 05:18:43,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 05:18:43,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 05:18:43,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 05:18:43,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 05:18:43,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 05:18:43,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 05:18:43,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 05:18:43,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 05:18:43,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 05:18:43,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 05:18:43,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 05:18:43,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 05:18:43,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 05:18:43,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 05:18:43,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 05:18:43,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 05:18:43,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 05:18:43,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 05:18:43,551 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 05:18:43,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 05:18:43,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 05:18:43,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 05:18:43,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 05:18:43,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 05:18:43,555 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 05:18:43,555 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 05:18:43,556 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 05:18:43,556 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 05:18:43,556 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 05:18:43,557 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 05:18:43,557 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 05:18:43,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 05:18:43,557 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 05:18:43,557 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 05:18:43,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 05:18:43,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 05:18:43,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 05:18:43,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 05:18:43,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 05:18:43,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 05:18:43,558 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 05:18:43,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 05:18:43,559 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 05:18:43,559 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 05:18:43,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 05:18:43,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 05:18:43,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 05:18:43,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 05:18:43,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 05:18:43,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 05:18:43,561 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 05:18:43,561 INFO L138 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.graphml 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 -> 0bbcd29b379466a58e055ac550736cd77ce56d9c [2021-08-31 05:18:43,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 05:18:43,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 05:18:43,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 05:18:43,956 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 05:18:43,956 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 05:18:43,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum05.i [2021-08-31 05:18:44,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26cdd6203/81e896177230448cbd7f0692c8f54cdd/FLAGdc2d205c0 [2021-08-31 05:18:44,450 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 05:18:44,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i [2021-08-31 05:18:44,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26cdd6203/81e896177230448cbd7f0692c8f54cdd/FLAGdc2d205c0 [2021-08-31 05:18:44,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26cdd6203/81e896177230448cbd7f0692c8f54cdd [2021-08-31 05:18:44,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 05:18:44,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 05:18:44,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 05:18:44,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 05:18:44,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 05:18:44,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d741a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44, skipping insertion in model container [2021-08-31 05:18:44,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 05:18:44,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 05:18:44,614 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i[1457,1470] [2021-08-31 05:18:44,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:18:44,621 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 05:18:44,639 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i[1457,1470] [2021-08-31 05:18:44,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:18:44,660 INFO L208 MainTranslator]: Completed translation [2021-08-31 05:18:44,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44 WrapperNode [2021-08-31 05:18:44,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 05:18:44,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 05:18:44,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 05:18:44,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 05:18:44,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 05:18:44,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 05:18:44,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 05:18:44,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 05:18:44,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 05:18:44,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 05:18:44,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 05:18:44,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 05:18:44,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (1/1) ... [2021-08-31 05:18:44,783 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:44,807 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) [2021-08-31 05:18:44,810 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 [2021-08-31 05:18:44,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 05:18:44,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 05:18:44,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 05:18:44,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 05:18:44,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 05:18:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 05:18:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 05:18:45,136 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 05:18:45,136 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-31 05:18:45,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:18:45 BoogieIcfgContainer [2021-08-31 05:18:45,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 05:18:45,138 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 05:18:45,138 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 05:18:45,141 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 05:18:45,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:18:45,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 05:18:44" (1/3) ... [2021-08-31 05:18:45,142 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@408ac935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:18:45, skipping insertion in model container [2021-08-31 05:18:45,142 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:18:45,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:44" (2/3) ... [2021-08-31 05:18:45,143 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@408ac935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:18:45, skipping insertion in model container [2021-08-31 05:18:45,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:18:45,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:18:45" (3/3) ... [2021-08-31 05:18:45,144 INFO L389 chiAutomizerObserver]: Analyzing ICFG rangesum05.i [2021-08-31 05:18:45,180 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 05:18:45,180 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 05:18:45,180 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 05:18:45,180 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 05:18:45,180 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 05:18:45,180 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 05:18:45,180 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 05:18:45,180 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 05:18:45,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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) [2021-08-31 05:18:45,247 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-31 05:18:45,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:45,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:45,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:18:45,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:18:45,253 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 05:18:45,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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) [2021-08-31 05:18:45,258 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-31 05:18:45,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:45,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:45,260 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:18:45,260 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:18:45,268 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 7#L-1true havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 22#L17-3true [2021-08-31 05:18:45,268 INFO L793 eck$LassoCheckResult]: Loop: 22#L17-3true assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 11#L17-2true init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 22#L17-3true [2021-08-31 05:18:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 05:18:45,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:45,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945914324] [2021-08-31 05:18:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:45,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:45,397 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:45,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:45,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-31 05:18:45,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:45,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691656712] [2021-08-31 05:18:45,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:45,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:45,455 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:45,461 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-31 05:18:45,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:45,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588082718] [2021-08-31 05:18:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:45,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:45,481 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:45,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:46,003 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:18:46,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:18:46,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:18:46,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:18:46,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:18:46,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:46,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:18:46,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:18:46,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration1_Lasso [2021-08-31 05:18:46,005 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:18:46,005 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:18:46,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:46,623 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:18:46,626 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:18:46,627 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:46,629 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) [2021-08-31 05:18:46,635 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 [2021-08-31 05:18:46,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:46,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:46,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:46,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:46,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:46,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:46,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:46,649 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 [2021-08-31 05:18:46,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:46,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:46,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:46,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:46,693 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) [2021-08-31 05:18:46,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:18:46,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:46,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:46,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:46,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:46,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:46,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:46,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:46,715 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 [2021-08-31 05:18:46,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:46,753 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 [2021-08-31 05:18:46,754 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:46,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:46,757 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) [2021-08-31 05:18:46,758 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 [2021-08-31 05:18:46,759 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 [2021-08-31 05:18:46,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:46,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:46,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:46,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:46,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:46,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:46,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:46,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:46,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:46,819 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:46,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:46,820 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) [2021-08-31 05:18:46,829 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 [2021-08-31 05:18:46,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:46,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:46,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:46,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:46,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:46,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:46,843 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 [2021-08-31 05:18:46,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:46,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:46,886 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:46,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:46,887 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) [2021-08-31 05:18:46,895 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 [2021-08-31 05:18:46,903 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 [2021-08-31 05:18:46,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:46,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:46,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:46,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:46,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:46,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:46,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:46,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:46,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:46,949 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:46,950 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) [2021-08-31 05:18:46,960 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 [2021-08-31 05:18:46,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:46,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:46,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:46,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:46,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:46,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:46,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:46,970 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 [2021-08-31 05:18:46,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:47,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:47,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:47,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:47,007 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) [2021-08-31 05:18:47,009 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 [2021-08-31 05:18:47,011 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 [2021-08-31 05:18:47,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:47,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:47,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:47,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:47,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:47,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:47,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:47,081 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 [2021-08-31 05:18:47,082 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:47,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:47,083 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) [2021-08-31 05:18:47,088 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 [2021-08-31 05:18:47,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:47,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:47,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:47,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:47,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:47,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:47,121 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 [2021-08-31 05:18:47,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:18:47,158 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-08-31 05:18:47,158 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-08-31 05:18:47,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:47,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:47,161 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) [2021-08-31 05:18:47,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:18:47,171 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 [2021-08-31 05:18:47,186 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:18:47,186 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:18:47,186 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_init_nondet_~i~0 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2021-08-31 05:18:47,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:47,239 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2021-08-31 05:18:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:47,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:18:47,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:47,310 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-31 05:18:47,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:47,367 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 [2021-08-31 05:18:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:47,403 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 05:18:47,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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) [2021-08-31 05:18:47,554 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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 75 states and 119 transitions. Complement of second has 8 states. [2021-08-31 05:18:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 05:18:47,560 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) [2021-08-31 05:18:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2021-08-31 05:18:47,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-31 05:18:47,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:47,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-31 05:18:47,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:47,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-31 05:18:47,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:47,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2021-08-31 05:18:47,578 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:47,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 32 transitions. [2021-08-31 05:18:47,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-31 05:18:47,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:18:47,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2021-08-31 05:18:47,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:47,583 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-31 05:18:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2021-08-31 05:18:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-31 05:18:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 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) [2021-08-31 05:18:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2021-08-31 05:18:47,604 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-31 05:18:47,604 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-31 05:18:47,604 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 05:18:47,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2021-08-31 05:18:47,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:47,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:47,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:47,609 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-31 05:18:47,609 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:47,609 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 193#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 204#L17-3 assume !(init_nondet_~i~0 < 5); 201#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 202#L28-3 [2021-08-31 05:18:47,610 INFO L793 eck$LassoCheckResult]: Loop: 202#L28-3 assume !!(rangesum_~i~1 < 5); 199#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 200#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 202#L28-3 [2021-08-31 05:18:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:47,611 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-31 05:18:47,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:47,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092741639] [2021-08-31 05:18:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:47,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:47,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:47,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092741639] [2021-08-31 05:18:47,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092741639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:18:47,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:18:47,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 05:18:47,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587808993] [2021-08-31 05:18:47,689 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:47,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:47,690 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-08-31 05:18:47,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:47,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993037838] [2021-08-31 05:18:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:47,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:47,707 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:47,725 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:47,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 05:18:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 05:18:47,780 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 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) [2021-08-31 05:18:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:47,835 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2021-08-31 05:18:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 05:18:47,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2021-08-31 05:18:47,838 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:47,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2021-08-31 05:18:47,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:18:47,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:18:47,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2021-08-31 05:18:47,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:47,840 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-08-31 05:18:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2021-08-31 05:18:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-31 05:18:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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) [2021-08-31 05:18:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-08-31 05:18:47,842 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-31 05:18:47,842 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-31 05:18:47,842 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 05:18:47,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-08-31 05:18:47,843 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:47,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:47,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:47,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:18:47,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:47,844 INFO L791 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 244#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 255#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 256#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 257#L17-3 assume !(init_nondet_~i~0 < 5); 250#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 251#L28-3 [2021-08-31 05:18:47,844 INFO L793 eck$LassoCheckResult]: Loop: 251#L28-3 assume !!(rangesum_~i~1 < 5); 252#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 253#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 251#L28-3 [2021-08-31 05:18:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-31 05:18:47,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:47,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970363954] [2021-08-31 05:18:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:47,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:47,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:47,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970363954] [2021-08-31 05:18:47,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970363954] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:18:47,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331133199] [2021-08-31 05:18:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:47,903 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:47,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:47,905 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:18:47,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-31 05:18:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:47,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:18:47,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:47,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:18:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:47,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331133199] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:18:47,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:18:47,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-08-31 05:18:47,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117865350] [2021-08-31 05:18:47,993 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:47,994 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2021-08-31 05:18:47,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:47,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740136365] [2021-08-31 05:18:47,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:47,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:47,998 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,003 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:48,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 05:18:48,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-31 05:18:48,057 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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) [2021-08-31 05:18:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:48,133 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-08-31 05:18:48,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 05:18:48,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2021-08-31 05:18:48,135 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:48,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 37 transitions. [2021-08-31 05:18:48,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:18:48,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:18:48,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-08-31 05:18:48,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:48,136 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 05:18:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-08-31 05:18:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-31 05:18:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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) [2021-08-31 05:18:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-08-31 05:18:48,138 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 05:18:48,138 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 05:18:48,138 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 05:18:48,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-08-31 05:18:48,138 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:48,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:48,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:48,139 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-31 05:18:48,139 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:48,139 INFO L791 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 334#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 346#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 347#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 348#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 349#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 360#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 359#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 358#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 357#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 356#L17-3 assume !(init_nondet_~i~0 < 5); 340#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 341#L28-3 [2021-08-31 05:18:48,140 INFO L793 eck$LassoCheckResult]: Loop: 341#L28-3 assume !!(rangesum_~i~1 < 5); 342#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 343#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 341#L28-3 [2021-08-31 05:18:48,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:48,140 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2021-08-31 05:18:48,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:48,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520287317] [2021-08-31 05:18:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:48,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:48,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520287317] [2021-08-31 05:18:48,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520287317] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:18:48,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261995143] [2021-08-31 05:18:48,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 05:18:48,187 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:48,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:48,188 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) [2021-08-31 05:18:48,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-31 05:18:48,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 05:18:48,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:18:48,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:18:48,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:48,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:18:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:48,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261995143] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:18:48,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:18:48,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-08-31 05:18:48,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493188944] [2021-08-31 05:18:48,323 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2021-08-31 05:18:48,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:48,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966510658] [2021-08-31 05:18:48,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,328 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:48,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-31 05:18:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-31 05:18:48,382 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2021-08-31 05:18:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:48,445 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2021-08-31 05:18:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 05:18:48,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2021-08-31 05:18:48,446 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:48,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2021-08-31 05:18:48,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:18:48,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:18:48,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2021-08-31 05:18:48,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:48,447 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-08-31 05:18:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2021-08-31 05:18:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-31 05:18:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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) [2021-08-31 05:18:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2021-08-31 05:18:48,449 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-08-31 05:18:48,449 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-08-31 05:18:48,449 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 05:18:48,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2021-08-31 05:18:48,450 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:48,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:48,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:48,450 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-31 05:18:48,450 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:48,450 INFO L791 eck$LassoCheckResult]: Stem: 468#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 469#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 480#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 481#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 482#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 483#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 497#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 496#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 495#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 494#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 493#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 492#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 491#L17-3 assume !(init_nondet_~i~0 < 5); 475#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 476#L28-3 [2021-08-31 05:18:48,451 INFO L793 eck$LassoCheckResult]: Loop: 476#L28-3 assume !!(rangesum_~i~1 < 5); 477#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 478#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 476#L28-3 [2021-08-31 05:18:48,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:48,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2021-08-31 05:18:48,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:48,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180108801] [2021-08-31 05:18:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,467 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:48,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2021-08-31 05:18:48,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:48,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058192189] [2021-08-31 05:18:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,486 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:48,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2021-08-31 05:18:48,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:48,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650499869] [2021-08-31 05:18:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-31 05:18:48,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:48,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650499869] [2021-08-31 05:18:48,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650499869] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:18:48,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:18:48,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 05:18:48,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554734336] [2021-08-31 05:18:48,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:48,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 05:18:48,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 05:18:48,574 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:18:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:48,638 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2021-08-31 05:18:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 05:18:48,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2021-08-31 05:18:48,642 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:48,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2021-08-31 05:18:48,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-31 05:18:48,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-31 05:18:48,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2021-08-31 05:18:48,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:48,645 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-08-31 05:18:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2021-08-31 05:18:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2021-08-31 05:18:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.25) internal successors, (45), 35 states have internal predecessors, (45), 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) [2021-08-31 05:18:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2021-08-31 05:18:48,654 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2021-08-31 05:18:48,654 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2021-08-31 05:18:48,654 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 05:18:48,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2021-08-31 05:18:48,658 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:48,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:48,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:48,659 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2021-08-31 05:18:48,659 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:48,659 INFO L791 eck$LassoCheckResult]: Stem: 545#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 546#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 558#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 559#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 560#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 561#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 580#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 579#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 578#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 577#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 574#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 573#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 572#L17-3 assume !(init_nondet_~i~0 < 5); 551#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 552#L28-3 assume !!(rangesum_~i~1 < 5); 553#L29 assume !(rangesum_~i~1 > 2); 554#L28-2 [2021-08-31 05:18:48,659 INFO L793 eck$LassoCheckResult]: Loop: 554#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 555#L28-3 assume !!(rangesum_~i~1 < 5); 576#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 554#L28-2 [2021-08-31 05:18:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425498, now seen corresponding path program 1 times [2021-08-31 05:18:48,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:48,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563455936] [2021-08-31 05:18:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,685 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,710 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:48,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:48,711 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 5 times [2021-08-31 05:18:48,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:48,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871571729] [2021-08-31 05:18:48,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,716 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:48,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813624, now seen corresponding path program 1 times [2021-08-31 05:18:48,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:48,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747990246] [2021-08-31 05:18:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-31 05:18:48,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:48,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747990246] [2021-08-31 05:18:48,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747990246] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:18:48,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156960520] [2021-08-31 05:18:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:48,767 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:48,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:48,769 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) [2021-08-31 05:18:48,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-31 05:18:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:48,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:18:48,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-31 05:18:48,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:18:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-31 05:18:48,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156960520] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:18:48,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:18:48,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-08-31 05:18:48,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550568599] [2021-08-31 05:18:48,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-31 05:18:48,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-31 05:18:48,944 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-08-31 05:18:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:49,023 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2021-08-31 05:18:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 05:18:49,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2021-08-31 05:18:49,024 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-31 05:18:49,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 66 transitions. [2021-08-31 05:18:49,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-08-31 05:18:49,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-08-31 05:18:49,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2021-08-31 05:18:49,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:49,026 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2021-08-31 05:18:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2021-08-31 05:18:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2021-08-31 05:18:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 53 states have internal predecessors, (63), 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) [2021-08-31 05:18:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2021-08-31 05:18:49,028 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2021-08-31 05:18:49,028 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2021-08-31 05:18:49,029 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 05:18:49,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2021-08-31 05:18:49,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:49,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:49,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:49,030 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 1, 1, 1, 1] [2021-08-31 05:18:49,030 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:49,030 INFO L791 eck$LassoCheckResult]: Stem: 757#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 758#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 770#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 771#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 772#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 773#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 797#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 796#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 795#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 794#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 793#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 787#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 786#L17-3 assume !(init_nondet_~i~0 < 5); 763#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 764#L28-3 assume !!(rangesum_~i~1 < 5); 765#L29 assume !(rangesum_~i~1 > 2); 766#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 767#L28-3 assume !!(rangesum_~i~1 < 5); 805#L29 assume !(rangesum_~i~1 > 2); 804#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 803#L28-3 assume !!(rangesum_~i~1 < 5); 801#L29 assume !(rangesum_~i~1 > 2); 792#L28-2 [2021-08-31 05:18:49,030 INFO L793 eck$LassoCheckResult]: Loop: 792#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 790#L28-3 assume !!(rangesum_~i~1 < 5); 791#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 792#L28-2 [2021-08-31 05:18:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808230, now seen corresponding path program 1 times [2021-08-31 05:18:49,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:49,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241388468] [2021-08-31 05:18:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:49,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:49,042 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:49,053 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 6 times [2021-08-31 05:18:49,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:49,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343575630] [2021-08-31 05:18:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:49,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:49,057 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:49,060 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash 272987720, now seen corresponding path program 2 times [2021-08-31 05:18:49,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:49,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103654760] [2021-08-31 05:18:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:49,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:49,075 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:49,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:50,367 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:18:50,368 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:18:50,368 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:18:50,368 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:18:50,368 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:18:50,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:50,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:18:50,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:18:50,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration7_Lasso [2021-08-31 05:18:50,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:18:50,368 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:18:50,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:50,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:18:50,971 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:18:50,972 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:50,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:50,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:18:50,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-31 05:18:50,980 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 [2021-08-31 05:18:50,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:50,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:50,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:50,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:50,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:50,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:50,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:50,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:51,007 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,008 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) [2021-08-31 05:18:51,011 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 [2021-08-31 05:18:51,012 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 [2021-08-31 05:18:51,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:51,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:51,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:51,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:51,036 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,037 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) [2021-08-31 05:18:51,038 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 [2021-08-31 05:18:51,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:18:51,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:51,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:51,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:51,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:51,079 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,080 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) [2021-08-31 05:18:51,081 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 [2021-08-31 05:18:51,082 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 [2021-08-31 05:18:51,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:51,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:51,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:51,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,106 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 [2021-08-31 05:18:51,106 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,107 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) [2021-08-31 05:18:51,108 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 [2021-08-31 05:18:51,109 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 [2021-08-31 05:18:51,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:51,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,169 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) [2021-08-31 05:18:51,179 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 [2021-08-31 05:18:51,179 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 [2021-08-31 05:18:51,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:51,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:51,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:51,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-08-31 05:18:51,214 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,214 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) [2021-08-31 05:18:51,216 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 [2021-08-31 05:18:51,217 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 [2021-08-31 05:18:51,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,244 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 [2021-08-31 05:18:51,245 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,245 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) [2021-08-31 05:18:51,247 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 [2021-08-31 05:18:51,248 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 [2021-08-31 05:18:51,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,288 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 [2021-08-31 05:18:51,289 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,289 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) [2021-08-31 05:18:51,291 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 [2021-08-31 05:18:51,291 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 [2021-08-31 05:18:51,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:51,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:51,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:51,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-08-31 05:18:51,317 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,318 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) [2021-08-31 05:18:51,319 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 [2021-08-31 05:18:51,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:18:51,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:51,362 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,363 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) [2021-08-31 05:18:51,363 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 [2021-08-31 05:18:51,364 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 [2021-08-31 05:18:51,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:51,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:51,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:51,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-08-31 05:18:51,389 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,390 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) [2021-08-31 05:18:51,392 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 [2021-08-31 05:18:51,393 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 [2021-08-31 05:18:51,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-08-31 05:18:51,436 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,437 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) [2021-08-31 05:18:51,438 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 [2021-08-31 05:18:51,439 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 [2021-08-31 05:18:51,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:51,480 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,481 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:18:51,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-31 05:18:51,482 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 [2021-08-31 05:18:51,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-08-31 05:18:51,507 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,507 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:18:51,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-31 05:18:51,509 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 [2021-08-31 05:18:51,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:51,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-08-31 05:18:51,542 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,543 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2021-08-31 05:18:51,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-31 05:18:51,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:18:51,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:51,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:51,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:51,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:51,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:51,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:51,584 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:18:51,601 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-08-31 05:18:51,601 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-08-31 05:18:51,602 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:51,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:51,609 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2021-08-31 05:18:51,614 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:18:51,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-31 05:18:51,629 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:18:51,629 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:18:51,630 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 7 Supporting invariants [] [2021-08-31 05:18:51,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:51,682 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2021-08-31 05:18:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:51,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:18:51,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:51,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:51,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 05:18:51,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:51,818 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-31 05:18:51,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2021-08-31 05:18:51,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 61 states and 73 transitions. Complement of second has 7 states. [2021-08-31 05:18:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 05:18:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2021-08-31 05:18:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-08-31 05:18:51,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2021-08-31 05:18:51,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:51,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 25 letters. Loop has 3 letters. [2021-08-31 05:18:51,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:51,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 6 letters. [2021-08-31 05:18:51,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:51,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2021-08-31 05:18:51,859 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:18:51,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 67 transitions. [2021-08-31 05:18:51,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-08-31 05:18:51,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-08-31 05:18:51,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2021-08-31 05:18:51,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:18:51,860 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2021-08-31 05:18:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2021-08-31 05:18:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-08-31 05:18:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 55 states have internal predecessors, (67), 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) [2021-08-31 05:18:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2021-08-31 05:18:51,863 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2021-08-31 05:18:51,863 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2021-08-31 05:18:51,863 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 05:18:51,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2021-08-31 05:18:51,864 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:18:51,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:51,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:51,865 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:18:51,865 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:51,865 INFO L791 eck$LassoCheckResult]: Stem: 1032#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1033#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1047#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1048#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1049#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1050#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1080#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1079#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1078#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1077#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1076#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1062#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1061#L17-3 assume !(init_nondet_~i~0 < 5); 1038#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1039#L28-3 assume !!(rangesum_~i~1 < 5); 1040#L29 assume !(rangesum_~i~1 > 2); 1041#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1045#L28-3 assume !!(rangesum_~i~1 < 5); 1042#L29 assume !(rangesum_~i~1 > 2); 1043#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1046#L28-3 assume !!(rangesum_~i~1 < 5); 1070#L29 assume !(rangesum_~i~1 > 2); 1066#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1063#L28-3 assume !(rangesum_~i~1 < 5); 1059#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1054#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1036#L28-8 assume !!(rangesum_~i~1 < 5); 1037#L29-2 assume !(rangesum_~i~1 > 2); 1051#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1052#L28-8 assume !!(rangesum_~i~1 < 5); 1075#L29-2 assume !(rangesum_~i~1 > 2); 1073#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1072#L28-8 assume !!(rangesum_~i~1 < 5); 1071#L29-2 assume !(rangesum_~i~1 > 2); 1067#L28-7 [2021-08-31 05:18:51,865 INFO L793 eck$LassoCheckResult]: Loop: 1067#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1064#L28-8 assume !!(rangesum_~i~1 < 5); 1065#L29-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1067#L28-7 [2021-08-31 05:18:51,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1909073688, now seen corresponding path program 1 times [2021-08-31 05:18:51,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:51,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508924037] [2021-08-31 05:18:51,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:51,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-31 05:18:51,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:51,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508924037] [2021-08-31 05:18:51,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508924037] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:18:51,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:18:51,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 05:18:51,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505606131] [2021-08-31 05:18:51,892 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:51,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2021-08-31 05:18:51,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:51,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982374856] [2021-08-31 05:18:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:51,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:51,896 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:51,898 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:51,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 05:18:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-31 05:18:51,942 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:18:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:52,006 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2021-08-31 05:18:52,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 05:18:52,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2021-08-31 05:18:52,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-08-31 05:18:52,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 82 transitions. [2021-08-31 05:18:52,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-08-31 05:18:52,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-08-31 05:18:52,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 82 transitions. [2021-08-31 05:18:52,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:18:52,011 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2021-08-31 05:18:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 82 transitions. [2021-08-31 05:18:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2021-08-31 05:18:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 57 states have internal predecessors, (67), 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) [2021-08-31 05:18:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2021-08-31 05:18:52,014 INFO L704 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-08-31 05:18:52,014 INFO L587 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-08-31 05:18:52,014 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 05:18:52,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 67 transitions. [2021-08-31 05:18:52,015 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-31 05:18:52,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:52,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:52,016 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:18:52,016 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:52,017 INFO L791 eck$LassoCheckResult]: Stem: 1166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1167#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1182#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1183#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1184#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1185#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1210#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1209#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1208#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1207#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1206#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1200#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1199#L17-3 assume !(init_nondet_~i~0 < 5); 1172#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1173#L28-3 assume !!(rangesum_~i~1 < 5); 1174#L29 assume !(rangesum_~i~1 > 2); 1175#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1179#L28-3 assume !!(rangesum_~i~1 < 5); 1218#L29 assume !(rangesum_~i~1 > 2); 1180#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1181#L28-3 assume !!(rangesum_~i~1 < 5); 1176#L29 assume !(rangesum_~i~1 > 2); 1177#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1214#L28-3 assume !!(rangesum_~i~1 < 5); 1212#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1204#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1201#L28-3 assume !(rangesum_~i~1 < 5); 1195#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1189#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1190#L28-8 assume !!(rangesum_~i~1 < 5); 1198#L29-2 assume !(rangesum_~i~1 > 2); 1186#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1170#L28-8 assume !!(rangesum_~i~1 < 5); 1171#L29-2 assume !(rangesum_~i~1 > 2); 1217#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1216#L28-8 assume !!(rangesum_~i~1 < 5); 1215#L29-2 assume !(rangesum_~i~1 > 2); 1211#L28-7 [2021-08-31 05:18:52,017 INFO L793 eck$LassoCheckResult]: Loop: 1211#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1213#L28-8 assume !!(rangesum_~i~1 < 5); 1203#L29-2 assume !(rangesum_~i~1 > 2); 1211#L28-7 [2021-08-31 05:18:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:52,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1744047494, now seen corresponding path program 1 times [2021-08-31 05:18:52,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:52,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40947473] [2021-08-31 05:18:52,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:52,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-31 05:18:52,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:52,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40947473] [2021-08-31 05:18:52,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40947473] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:18:52,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522920340] [2021-08-31 05:18:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:52,065 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:52,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:52,069 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:18:52,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-31 05:18:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:52,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:18:52,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-31 05:18:52,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 05:18:52,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522920340] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:18:52,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 05:18:52,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-08-31 05:18:52,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91141873] [2021-08-31 05:18:52,190 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2021-08-31 05:18:52,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:52,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563421706] [2021-08-31 05:18:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:52,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:52,194 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:52,195 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:52,208 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:18:52,208 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:18:52,208 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:18:52,208 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:18:52,208 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 05:18:52,209 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:52,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:18:52,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:18:52,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration9_Loop [2021-08-31 05:18:52,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:18:52,209 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:18:52,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:52,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:52,225 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:18:52,226 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 05:18:52,227 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:52,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:52,229 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2021-08-31 05:18:52,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 05:18:52,237 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:18:52,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-31 05:18:52,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:52,279 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:52,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:52,280 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2021-08-31 05:18:52,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-31 05:18:52,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 05:18:52,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:18:52,368 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 05:18:52,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:52,376 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:18:52,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:18:52,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:18:52,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:18:52,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:18:52,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:52,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:18:52,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:18:52,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration9_Loop [2021-08-31 05:18:52,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:18:52,376 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:18:52,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:52,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:18:52,395 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:18:52,395 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:18:52,395 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:52,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:52,396 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2021-08-31 05:18:52,413 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 [2021-08-31 05:18:52,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:52,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:52,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:52,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:52,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:52,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:52,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:52,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-31 05:18:52,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:18:52,434 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 05:18:52,434 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 05:18:52,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:52,436 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2021-08-31 05:18:52,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-31 05:18:52,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:18:52,437 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 05:18:52,437 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:18:52,438 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 3 Supporting invariants [] [2021-08-31 05:18:52,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:52,464 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 05:18:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:52,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:18:52,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:52,572 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 05:18:52,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:18:52,590 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 05:18:52,590 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2021-08-31 05:18:52,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 71 states and 83 transitions. Complement of second has 5 states. [2021-08-31 05:18:52,639 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 [2021-08-31 05:18:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2021-08-31 05:18:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2021-08-31 05:18:52,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 3 letters. [2021-08-31 05:18:52,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:52,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2021-08-31 05:18:52,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:52,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 6 letters. [2021-08-31 05:18:52,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:52,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 83 transitions. [2021-08-31 05:18:52,642 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:18:52,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 62 states and 72 transitions. [2021-08-31 05:18:52,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-08-31 05:18:52,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-08-31 05:18:52,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 72 transitions. [2021-08-31 05:18:52,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:18:52,643 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-08-31 05:18:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 72 transitions. [2021-08-31 05:18:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-08-31 05:18:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 60 states have internal predecessors, (71), 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) [2021-08-31 05:18:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2021-08-31 05:18:52,646 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2021-08-31 05:18:52,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:52,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 05:18:52,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-31 05:18:52,646 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:18:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:52,704 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2021-08-31 05:18:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 05:18:52,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 85 transitions. [2021-08-31 05:18:52,706 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:52,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 85 transitions. [2021-08-31 05:18:52,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-08-31 05:18:52,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-08-31 05:18:52,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 85 transitions. [2021-08-31 05:18:52,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:18:52,706 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 85 transitions. [2021-08-31 05:18:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 85 transitions. [2021-08-31 05:18:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2021-08-31 05:18:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 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) [2021-08-31 05:18:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2021-08-31 05:18:52,710 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 69 transitions. [2021-08-31 05:18:52,710 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 69 transitions. [2021-08-31 05:18:52,710 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 05:18:52,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 69 transitions. [2021-08-31 05:18:52,710 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:18:52,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:52,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:52,711 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:18:52,711 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:52,711 INFO L791 eck$LassoCheckResult]: Stem: 1678#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1679#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1696#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1697#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1698#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1699#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1708#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1728#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1726#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1724#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1723#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1720#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1719#L17-3 assume !(init_nondet_~i~0 < 5); 1686#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1687#L28-3 assume !!(rangesum_~i~1 < 5); 1688#L29 assume !(rangesum_~i~1 > 2); 1689#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1694#L28-3 assume !!(rangesum_~i~1 < 5); 1712#L29 assume !(rangesum_~i~1 > 2); 1729#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1730#L28-3 assume !!(rangesum_~i~1 < 5); 1690#L29 assume !(rangesum_~i~1 > 2); 1691#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1695#L28-3 assume !!(rangesum_~i~1 < 5); 1727#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1725#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1710#L28-3 assume !(rangesum_~i~1 < 5); 1711#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 1704#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1705#L28-8 assume !!(rangesum_~i~1 < 5); 1716#L29-2 assume !(rangesum_~i~1 > 2); 1700#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1701#L28-8 assume !!(rangesum_~i~1 < 5); 1717#L29-2 assume !(rangesum_~i~1 > 2); 1718#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1733#L28-8 assume !!(rangesum_~i~1 < 5); 1732#L29-2 assume !(rangesum_~i~1 > 2); 1731#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1682#L28-8 assume !!(rangesum_~i~1 < 5); 1683#L29-2 [2021-08-31 05:18:52,711 INFO L793 eck$LassoCheckResult]: Loop: 1683#L29-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1722#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1721#L28-8 assume !!(rangesum_~i~1 < 5); 1683#L29-2 [2021-08-31 05:18:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash 734232641, now seen corresponding path program 1 times [2021-08-31 05:18:52,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:52,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274371335] [2021-08-31 05:18:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:52,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:52,719 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:18:52,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181061134] [2021-08-31 05:18:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:52,720 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:52,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:52,721 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:18:52,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-31 05:18:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:52,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:18:52,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-31 05:18:52,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:18:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-31 05:18:52,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:52,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274371335] [2021-08-31 05:18:52,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-31 05:18:52,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181061134] [2021-08-31 05:18:52,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181061134] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:18:52,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-31 05:18:52,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-08-31 05:18:52,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300949380] [2021-08-31 05:18:52,953 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2021-08-31 05:18:52,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:52,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50014511] [2021-08-31 05:18:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:52,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:52,957 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:52,960 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:53,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:53,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 05:18:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-31 05:18:53,026 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-08-31 05:18:53,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:53,136 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2021-08-31 05:18:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 05:18:53,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 91 transitions. [2021-08-31 05:18:53,137 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-08-31 05:18:53,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 78 states and 89 transitions. [2021-08-31 05:18:53,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-08-31 05:18:53,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-08-31 05:18:53,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 89 transitions. [2021-08-31 05:18:53,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:18:53,138 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2021-08-31 05:18:53,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 89 transitions. [2021-08-31 05:18:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2021-08-31 05:18:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 66 states have internal predecessors, (76), 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) [2021-08-31 05:18:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2021-08-31 05:18:53,140 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-08-31 05:18:53,140 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-08-31 05:18:53,140 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 05:18:53,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 76 transitions. [2021-08-31 05:18:53,141 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:18:53,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:53,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:53,142 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:18:53,142 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:53,142 INFO L791 eck$LassoCheckResult]: Stem: 2057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 2058#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2076#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2077#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2078#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2079#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2111#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2109#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2107#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2105#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2101#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2097#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2096#L17-3 assume !(init_nondet_~i~0 < 5); 2065#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2066#L28-3 assume !!(rangesum_~i~1 < 5); 2067#L29 assume !(rangesum_~i~1 > 2); 2068#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2073#L28-3 assume !!(rangesum_~i~1 < 5); 2090#L29 assume !(rangesum_~i~1 > 2); 2074#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2075#L28-3 assume !!(rangesum_~i~1 < 5); 2069#L29 assume !(rangesum_~i~1 > 2); 2070#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2117#L28-3 assume !!(rangesum_~i~1 < 5); 2116#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2103#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2106#L28-3 assume !!(rangesum_~i~1 < 5); 2102#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2104#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2088#L28-3 assume !(rangesum_~i~1 < 5); 2089#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2084#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2061#L28-8 assume !!(rangesum_~i~1 < 5); 2062#L29-2 assume !(rangesum_~i~1 > 2); 2080#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2081#L28-8 assume !!(rangesum_~i~1 < 5); 2094#L29-2 assume !(rangesum_~i~1 > 2); 2095#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2118#L28-8 assume !!(rangesum_~i~1 < 5); 2115#L29-2 assume !(rangesum_~i~1 > 2); 2114#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2113#L28-8 assume !!(rangesum_~i~1 < 5); 2112#L29-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2110#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2108#L28-8 assume !!(rangesum_~i~1 < 5); 2099#L29-2 [2021-08-31 05:18:53,142 INFO L793 eck$LassoCheckResult]: Loop: 2099#L29-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2100#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2098#L28-8 assume !!(rangesum_~i~1 < 5); 2099#L29-2 [2021-08-31 05:18:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1040814406, now seen corresponding path program 1 times [2021-08-31 05:18:53,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977128408] [2021-08-31 05:18:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,150 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:18:53,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534079047] [2021-08-31 05:18:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,151 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:53,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:53,152 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:18:53,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-31 05:18:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,237 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,296 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,297 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2021-08-31 05:18:53,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165156138] [2021-08-31 05:18:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,299 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,302 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1533007565, now seen corresponding path program 2 times [2021-08-31 05:18:53,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205938779] [2021-08-31 05:18:53,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,309 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:18:53,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128809740] [2021-08-31 05:18:53,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 05:18:53,325 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:53,364 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:18:53,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-08-31 05:18:53,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 05:18:53,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:18:53,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 05:18:53,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-31 05:18:53,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 05:18:53,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:53,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205938779] [2021-08-31 05:18:53,557 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-31 05:18:53,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128809740] [2021-08-31 05:18:53,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128809740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:18:53,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:18:53,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 05:18:53,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780907920] [2021-08-31 05:18:53,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:53,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 05:18:53,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-31 05:18:53,616 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. cyclomatic complexity: 15 Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-08-31 05:18:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:53,672 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-08-31 05:18:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 05:18:53,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 82 transitions. [2021-08-31 05:18:53,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-31 05:18:53,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 70 transitions. [2021-08-31 05:18:53,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-08-31 05:18:53,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-08-31 05:18:53,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 70 transitions. [2021-08-31 05:18:53,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:18:53,674 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-08-31 05:18:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 70 transitions. [2021-08-31 05:18:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2021-08-31 05:18:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 55 states have internal predecessors, (60), 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) [2021-08-31 05:18:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-08-31 05:18:53,675 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-08-31 05:18:53,676 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-08-31 05:18:53,676 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 05:18:53,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2021-08-31 05:18:53,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-31 05:18:53,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:53,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:53,677 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:18:53,677 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:18:53,677 INFO L791 eck$LassoCheckResult]: Stem: 2353#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 2354#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2374#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2375#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2376#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2377#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2408#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2407#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2406#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2405#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2404#L17-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2390#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2389#L17-3 assume !(init_nondet_~i~0 < 5); 2361#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2362#L28-3 assume !!(rangesum_~i~1 < 5); 2363#L29 assume !(rangesum_~i~1 > 2); 2364#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2367#L28-3 assume !!(rangesum_~i~1 < 5); 2384#L29 assume !(rangesum_~i~1 > 2); 2368#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2369#L28-3 assume !!(rangesum_~i~1 < 5); 2365#L29 assume !(rangesum_~i~1 > 2); 2366#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2402#L28-3 assume !!(rangesum_~i~1 < 5); 2399#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2397#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2382#L28-3 assume !!(rangesum_~i~1 < 5); 2383#L29 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2393#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2392#L28-3 assume !(rangesum_~i~1 < 5); 2386#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2378#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2357#L28-8 assume !!(rangesum_~i~1 < 5); 2358#L29-2 assume !(rangesum_~i~1 > 2); 2371#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2372#L28-8 assume !!(rangesum_~i~1 < 5); 2388#L29-2 assume !(rangesum_~i~1 > 2); 2373#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2359#L28-8 assume !!(rangesum_~i~1 < 5); 2360#L29-2 assume !(rangesum_~i~1 > 2); 2403#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2401#L28-8 assume !!(rangesum_~i~1 < 5); 2400#L29-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2398#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2396#L28-8 assume !!(rangesum_~i~1 < 5); 2395#L29-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2394#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2391#L28-8 assume !(rangesum_~i~1 < 5); 2385#L28-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2379#L37-1 main_#t~ret10 := rangesum_#res;main_~ret2~0 := main_#t~ret10;havoc main_#t~ret10;call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~2 := 0; 2380#L54-3 [2021-08-31 05:18:53,677 INFO L793 eck$LassoCheckResult]: Loop: 2380#L54-3 assume !!(main_~i~2 < 4);call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem13, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem13; 2381#L54-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 2380#L54-3 [2021-08-31 05:18:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash -46487371, now seen corresponding path program 1 times [2021-08-31 05:18:53,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583782702] [2021-08-31 05:18:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,690 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:18:53,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637639265] [2021-08-31 05:18:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:53,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:53,692 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:18:53,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-08-31 05:18:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,766 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,821 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2021-08-31 05:18:53,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207982842] [2021-08-31 05:18:53,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,826 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,828 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1724688201, now seen corresponding path program 1 times [2021-08-31 05:18:53,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655879286] [2021-08-31 05:18:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,836 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:18:53,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636795098] [2021-08-31 05:18:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,837 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:53,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:53,844 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:18:53,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-08-31 05:18:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,921 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,976 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:23,910 WARN L210 SmtUtils]: Spent 29.88s on a formula simplification. DAG size of input: 387 DAG size of output: 283 [2021-08-31 05:19:42,629 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:19:42,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:19:42,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:19:42,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:19:42,630 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:19:42,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:42,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:19:42,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:19:42,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration12_Lasso [2021-08-31 05:19:42,630 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:19:42,630 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:19:42,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:42,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:42,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:42,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:42,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:43,017 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 05:19:43,020 INFO L158 Benchmark]: Toolchain (without parser) took 58551.38ms. Allocated memory was 56.6MB in the beginning and 111.1MB in the end (delta: 54.5MB). Free memory was 34.8MB in the beginning and 54.8MB in the end (delta: -20.0MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2021-08-31 05:19:43,021 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:19:43,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.93ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 40.0MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 05:19:43,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.71ms. Allocated memory is still 56.6MB. Free memory was 39.8MB in the beginning and 37.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:19:43,022 INFO L158 Benchmark]: Boogie Preprocessor took 31.71ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 36.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:19:43,022 INFO L158 Benchmark]: RCFGBuilder took 367.49ms. Allocated memory is still 56.6MB. Free memory was 36.5MB in the beginning and 25.7MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 05:19:43,022 INFO L158 Benchmark]: BuchiAutomizer took 57881.83ms. Allocated memory was 56.6MB in the beginning and 111.1MB in the end (delta: 54.5MB). Free memory was 25.5MB in the beginning and 54.8MB in the end (delta: -29.3MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2021-08-31 05:19:43,024 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.93ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 40.0MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.71ms. Allocated memory is still 56.6MB. Free memory was 39.8MB in the beginning and 37.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.71ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 36.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 367.49ms. Allocated memory is still 56.6MB. Free memory was 36.5MB in the beginning and 25.7MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 57881.83ms. Allocated memory was 56.6MB in the beginning and 111.1MB in the end (delta: 54.5MB). Free memory was 25.5MB in the beginning and 54.8MB in the end (delta: -29.3MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 05:19:43,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:43,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2021-08-31 05:19:43,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:43,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2021-08-31 05:19:43,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2021-08-31 05:19:44,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-08-31 05:19:44,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-08-31 05:19:44,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-31 05:19:44,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:44,992 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...