./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/id_build.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/loop-invgen/id_build.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 8e693e301fe03afa61a3f7e2110361a5e60df7f9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 02:45:17,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 02:45:17,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 02:45:17,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 02:45:17,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 02:45:17,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 02:45:17,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 02:45:17,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 02:45:17,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 02:45:17,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 02:45:17,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 02:45:17,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 02:45:17,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 02:45:17,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 02:45:17,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 02:45:17,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 02:45:17,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 02:45:17,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 02:45:17,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 02:45:17,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 02:45:17,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 02:45:17,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 02:45:17,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 02:45:17,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 02:45:17,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 02:45:17,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 02:45:17,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 02:45:17,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 02:45:17,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 02:45:17,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 02:45:17,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 02:45:17,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 02:45:17,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 02:45:17,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 02:45:17,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 02:45:17,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 02:45:17,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 02:45:17,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 02:45:17,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 02:45:17,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 02:45:17,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 02:45:17,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 02:45:17,429 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 02:45:17,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 02:45:17,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 02:45:17,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 02:45:17,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 02:45:17,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 02:45:17,431 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 02:45:17,431 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 02:45:17,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 02:45:17,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 02:45:17,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 02:45:17,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 02:45:17,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 02:45:17,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 02:45:17,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 02:45:17,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 02:45:17,435 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 02:45:17,435 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 -> 8e693e301fe03afa61a3f7e2110361a5e60df7f9 [2021-08-31 02:45:17,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 02:45:17,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 02:45:17,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 02:45:17,701 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 02:45:17,701 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 02:45:17,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2021-08-31 02:45:17,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a201647b3/a1e16e657493487ba4d0f3acbae648ed/FLAGda58264f1 [2021-08-31 02:45:18,036 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 02:45:18,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2021-08-31 02:45:18,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a201647b3/a1e16e657493487ba4d0f3acbae648ed/FLAGda58264f1 [2021-08-31 02:45:18,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a201647b3/a1e16e657493487ba4d0f3acbae648ed [2021-08-31 02:45:18,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 02:45:18,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 02:45:18,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 02:45:18,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 02:45:18,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 02:45:18,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f79938f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18, skipping insertion in model container [2021-08-31 02:45:18,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 02:45:18,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 02:45:18,675 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/loop-invgen/id_build.i[893,906] [2021-08-31 02:45:18,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:45:18,695 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 02:45:18,710 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/loop-invgen/id_build.i[893,906] [2021-08-31 02:45:18,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:45:18,774 INFO L208 MainTranslator]: Completed translation [2021-08-31 02:45:18,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18 WrapperNode [2021-08-31 02:45:18,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 02:45:18,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 02:45:18,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 02:45:18,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 02:45:18,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 02:45:18,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 02:45:18,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 02:45:18,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 02:45:18,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 02:45:18,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 02:45:18,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 02:45:18,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 02:45:18,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (1/1) ... [2021-08-31 02:45:18,838 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:18,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:18,864 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 02:45:18,881 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 02:45:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 02:45:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 02:45:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 02:45:18,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 02:45:19,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 02:45:19,021 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-31 02:45:19,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:45:19 BoogieIcfgContainer [2021-08-31 02:45:19,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 02:45:19,024 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 02:45:19,024 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 02:45:19,026 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 02:45:19,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:45:19,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 02:45:18" (1/3) ... [2021-08-31 02:45:19,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18bee4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:45:19, skipping insertion in model container [2021-08-31 02:45:19,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:45:19,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:45:18" (2/3) ... [2021-08-31 02:45:19,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18bee4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:45:19, skipping insertion in model container [2021-08-31 02:45:19,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:45:19,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:45:19" (3/3) ... [2021-08-31 02:45:19,030 INFO L389 chiAutomizerObserver]: Analyzing ICFG id_build.i [2021-08-31 02:45:19,068 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 02:45:19,068 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 02:45:19,068 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 02:45:19,068 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 02:45:19,068 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 02:45:19,068 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 02:45:19,068 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 02:45:19,068 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 02:45:19,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 02:45:19,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-08-31 02:45:19,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:45:19,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:45:19,097 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:45:19,097 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:45:19,097 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 02:45:19,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 02:45:19,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-08-31 02:45:19,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:45:19,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:45:19,099 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:45:19,100 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:45:19,106 INFO L791 eck$LassoCheckResult]: Stem: 4#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(9); 9#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 15#L27-3true [2021-08-31 02:45:19,106 INFO L793 eck$LassoCheckResult]: Loop: 15#L27-3true assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 8#L28-2true assume !(main_~j~0 < 8); 11#L27-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 15#L27-3true [2021-08-31 02:45:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 02:45:19,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:19,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268715167] [2021-08-31 02:45:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:19,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:19,196 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:19,228 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:19,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash 39940, now seen corresponding path program 1 times [2021-08-31 02:45:19,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:19,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89992245] [2021-08-31 02:45:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:19,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:19,320 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 02:45:19,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:45:19,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89992245] [2021-08-31 02:45:19,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89992245] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:45:19,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:45:19,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 02:45:19,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407422540] [2021-08-31 02:45:19,324 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:45:19,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:45:19,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:45:19,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:45:19,362 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 02:45:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:45:19,427 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2021-08-31 02:45:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:45:19,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2021-08-31 02:45:19,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-08-31 02:45:19,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 15 transitions. [2021-08-31 02:45:19,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-08-31 02:45:19,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-08-31 02:45:19,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2021-08-31 02:45:19,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:45:19,436 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-31 02:45:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2021-08-31 02:45:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2021-08-31 02:45:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-08-31 02:45:19,469 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-31 02:45:19,469 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-31 02:45:19,469 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 02:45:19,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-08-31 02:45:19,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-08-31 02:45:19,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:45:19,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:45:19,470 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:45:19,470 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:45:19,470 INFO L791 eck$LassoCheckResult]: Stem: 48#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(9); 49#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 53#L27-3 [2021-08-31 02:45:19,470 INFO L793 eck$LassoCheckResult]: Loop: 53#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 54#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 46#L18 assume !(0 == __VERIFIER_assert_~cond); 47#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 50#L18-3 assume !(0 == __VERIFIER_assert_~cond); 51#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 52#L28-2 assume !(main_~j~0 < 8); 55#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 53#L27-3 [2021-08-31 02:45:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 02:45:19,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:19,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760789501] [2021-08-31 02:45:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:19,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:19,485 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:19,501 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:19,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:19,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2021355157, now seen corresponding path program 1 times [2021-08-31 02:45:19,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:19,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943111467] [2021-08-31 02:45:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:19,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:19,526 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 02:45:19,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:45:19,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943111467] [2021-08-31 02:45:19,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943111467] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:45:19,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984607048] [2021-08-31 02:45:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:19,527 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:45:19,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:19,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:45:19,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-31 02:45:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:19,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 02:45:19,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:19,625 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 02:45:19,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 02:45:19,653 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 02:45:19,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984607048] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 02:45:19,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 02:45:19,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-08-31 02:45:19,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073134233] [2021-08-31 02:45:19,654 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:45:19,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:45:19,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-31 02:45:19,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-31 02:45:19,655 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 02:45:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:45:19,690 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-08-31 02:45:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 02:45:19,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2021-08-31 02:45:19,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-08-31 02:45:19,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2021-08-31 02:45:19,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-31 02:45:19,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-31 02:45:19,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2021-08-31 02:45:19,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:45:19,693 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-31 02:45:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2021-08-31 02:45:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-08-31 02:45:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 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 02:45:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-08-31 02:45:19,695 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-31 02:45:19,695 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-31 02:45:19,695 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 02:45:19,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-08-31 02:45:19,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-08-31 02:45:19,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:45:19,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:45:19,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:45:19,696 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 1, 1, 1] [2021-08-31 02:45:19,696 INFO L791 eck$LassoCheckResult]: Stem: 134#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(9); 135#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 140#L27-3 [2021-08-31 02:45:19,696 INFO L793 eck$LassoCheckResult]: Loop: 140#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 141#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 156#L18 assume !(0 == __VERIFIER_assert_~cond); 155#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 154#L18-3 assume !(0 == __VERIFIER_assert_~cond); 136#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 137#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 132#L18 assume !(0 == __VERIFIER_assert_~cond); 133#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 138#L18-3 assume !(0 == __VERIFIER_assert_~cond); 139#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 153#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 152#L18 assume !(0 == __VERIFIER_assert_~cond); 151#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 150#L18-3 assume !(0 == __VERIFIER_assert_~cond); 149#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 148#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 144#L18 assume !(0 == __VERIFIER_assert_~cond); 147#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 146#L18-3 assume !(0 == __VERIFIER_assert_~cond); 145#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 143#L28-2 assume !(main_~j~0 < 8); 142#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 140#L27-3 [2021-08-31 02:45:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 02:45:19,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:19,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778991753] [2021-08-31 02:45:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:19,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:19,703 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:19,709 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2131610428, now seen corresponding path program 2 times [2021-08-31 02:45:19,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:19,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290897590] [2021-08-31 02:45:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:19,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:45:19,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:45:19,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290897590] [2021-08-31 02:45:19,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290897590] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:45:19,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739173284] [2021-08-31 02:45:19,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 02:45:19,762 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:45:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:19,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:45:19,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-31 02:45:19,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 02:45:19,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 02:45:19,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 02:45:19,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:45:19,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 02:45:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:45:20,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739173284] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 02:45:20,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 02:45:20,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-08-31 02:45:20,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814241327] [2021-08-31 02:45:20,018 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:45:20,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:45:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-31 02:45:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-31 02:45:20,019 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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 02:45:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:45:20,071 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-08-31 02:45:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-31 02:45:20,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2021-08-31 02:45:20,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-08-31 02:45:20,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2021-08-31 02:45:20,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-08-31 02:45:20,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-08-31 02:45:20,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2021-08-31 02:45:20,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:45:20,074 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-08-31 02:45:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2021-08-31 02:45:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-08-31 02:45:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 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 02:45:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-08-31 02:45:20,077 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-08-31 02:45:20,077 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-08-31 02:45:20,077 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 02:45:20,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 46 transitions. [2021-08-31 02:45:20,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-08-31 02:45:20,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:45:20,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:45:20,079 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:45:20,079 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 1, 1, 1] [2021-08-31 02:45:20,079 INFO L791 eck$LassoCheckResult]: Stem: 349#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(9); 350#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 355#L27-3 [2021-08-31 02:45:20,079 INFO L793 eck$LassoCheckResult]: Loop: 355#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 356#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 391#L18 assume !(0 == __VERIFIER_assert_~cond); 390#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 389#L18-3 assume !(0 == __VERIFIER_assert_~cond); 352#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 353#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 347#L18 assume !(0 == __VERIFIER_assert_~cond); 348#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 351#L18-3 assume !(0 == __VERIFIER_assert_~cond); 354#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 388#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 387#L18 assume !(0 == __VERIFIER_assert_~cond); 386#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 385#L18-3 assume !(0 == __VERIFIER_assert_~cond); 384#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 383#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 382#L18 assume !(0 == __VERIFIER_assert_~cond); 381#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 380#L18-3 assume !(0 == __VERIFIER_assert_~cond); 379#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 378#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 377#L18 assume !(0 == __VERIFIER_assert_~cond); 376#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 375#L18-3 assume !(0 == __VERIFIER_assert_~cond); 374#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 373#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 372#L18 assume !(0 == __VERIFIER_assert_~cond); 371#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 370#L18-3 assume !(0 == __VERIFIER_assert_~cond); 369#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 368#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 367#L18 assume !(0 == __VERIFIER_assert_~cond); 366#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 365#L18-3 assume !(0 == __VERIFIER_assert_~cond); 364#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 363#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 359#L18 assume !(0 == __VERIFIER_assert_~cond); 362#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 361#L18-3 assume !(0 == __VERIFIER_assert_~cond); 360#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 358#L28-2 assume !(main_~j~0 < 8); 357#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 355#L27-3 [2021-08-31 02:45:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-31 02:45:20,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:20,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009622969] [2021-08-31 02:45:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:20,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:20,086 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:20,092 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1675619716, now seen corresponding path program 3 times [2021-08-31 02:45:20,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:20,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510473470] [2021-08-31 02:45:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:20,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:20,106 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:20,125 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -532421502, now seen corresponding path program 1 times [2021-08-31 02:45:20,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:20,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93493044] [2021-08-31 02:45:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:20,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:20,142 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:20,163 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:20,593 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 02:45:20,594 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 02:45:20,594 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 02:45:20,594 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 02:45:20,594 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 02:45:20,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:20,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 02:45:20,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 02:45:20,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration4_Loop [2021-08-31 02:45:20,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 02:45:20,594 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 02:45:20,605 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 02:45:20,609 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 02:45:20,612 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 02:45:20,614 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 02:45:20,618 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 02:45:20,656 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 02:45:20,656 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 02:45:20,657 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:20,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:20,689 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 02:45:20,692 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 02:45:20,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:20,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:20,702 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 02:45:20,703 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 02:45:20,742 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 02:45:20,743 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:20,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:20,750 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 02:45:20,751 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 02:45:20,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:20,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:20,777 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 02:45:20,777 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=8} Honda state: {ULTIMATE.start_main_~j~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 02:45:20,796 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 02:45:20,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:20,813 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 02:45:20,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:20,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:20,824 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 02:45:20,845 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 02:45:20,845 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 02:45:20,862 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 02:45:20,862 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:20,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:20,873 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 02:45:20,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:20,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:20,906 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 02:45:20,924 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 02:45:20,924 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 02:45:20,947 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 02:45:20,948 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:20,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:20,949 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 02:45:20,951 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 02:45:20,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:20,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:20,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-08-31 02:45:20,976 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:20,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:20,976 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 02:45:20,977 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 02:45:20,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 02:45:20,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:21,041 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 02:45:21,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-08-31 02:45:21,045 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 02:45:21,045 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 02:45:21,045 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 02:45:21,045 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 02:45:21,045 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 02:45:21,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 02:45:21,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 02:45:21,046 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration4_Loop [2021-08-31 02:45:21,046 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 02:45:21,046 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 02:45:21,047 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 02:45:21,051 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 02:45:21,053 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 02:45:21,056 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 02:45:21,058 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 02:45:21,097 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 02:45:21,100 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 02:45:21,101 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,116 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 02:45:21,167 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 02:45:21,168 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 02:45:21,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:45:21,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:45:21,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:45:21,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:45:21,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:45:21,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:45:21,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:45:21,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:45:21,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-08-31 02:45:21,212 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,214 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:45:21,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-31 02:45:21,216 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 02:45:21,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:45:21,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:45:21,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:45:21,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:45:21,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:45:21,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:45:21,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:45:21,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:45:21,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:21,259 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:45:21,267 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 02:45:21,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:45:21,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:45:21,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:45:21,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:45:21,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:45:21,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:45:21,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:45:21,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-31 02:45:21,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:45:21,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:21,305 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,306 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:45:21,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-31 02:45:21,308 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 02:45:21,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:45:21,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:45:21,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:45:21,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:45:21,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:45:21,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:45:21,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:45:21,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:45:21,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:21,349 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,350 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 02:45:21,351 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 02:45:21,352 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 02:45:21,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:45:21,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:45:21,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:45:21,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:45:21,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:45:21,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:45:21,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:45:21,375 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 02:45:21,378 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 02:45:21,378 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 02:45:21,379 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,380 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 02:45:21,381 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 02:45:21,382 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 02:45:21,382 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 02:45:21,382 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 02:45:21,383 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nlen~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nlen~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2021-08-31 02:45:21,401 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 02:45:21,404 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 02:45:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:21,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 02:45:21,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:21,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 02:45:21,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:21,499 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 02:45:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-31 02:45:21,677 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 02:45:21,678 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:21,705 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 88 states and 91 transitions. Complement of second has 4 states. [2021-08-31 02:45:21,706 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 02:45:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2021-08-31 02:45:21,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 43 letters. [2021-08-31 02:45:21,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:21,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 45 letters. Loop has 43 letters. [2021-08-31 02:45:21,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:21,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 86 letters. [2021-08-31 02:45:21,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:21,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 91 transitions. [2021-08-31 02:45:21,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 02:45:21,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 90 transitions. [2021-08-31 02:45:21,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-08-31 02:45:21,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-08-31 02:45:21,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 90 transitions. [2021-08-31 02:45:21,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 02:45:21,713 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 90 transitions. [2021-08-31 02:45:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 90 transitions. [2021-08-31 02:45:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2021-08-31 02:45:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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 02:45:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-08-31 02:45:21,716 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-08-31 02:45:21,716 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-08-31 02:45:21,716 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 02:45:21,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 54 transitions. [2021-08-31 02:45:21,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 02:45:21,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:45:21,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:45:21,717 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-08-31 02:45:21,717 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 02:45:21,718 INFO L791 eck$LassoCheckResult]: Stem: 639#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(9); 640#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 649#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 645#L28-2 [2021-08-31 02:45:21,718 INFO L793 eck$LassoCheckResult]: Loop: 645#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 635#L18 assume !(0 == __VERIFIER_assert_~cond); 636#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 641#L18-3 assume !(0 == __VERIFIER_assert_~cond); 644#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 645#L28-2 [2021-08-31 02:45:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2021-08-31 02:45:21,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:21,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446958832] [2021-08-31 02:45:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:21,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:21,724 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:21,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 46025336, now seen corresponding path program 1 times [2021-08-31 02:45:21,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:21,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079010542] [2021-08-31 02:45:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:21,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:21,735 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:21,740 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:21,741 INFO L82 PathProgramCache]: Analyzing trace with hash 271240594, now seen corresponding path program 1 times [2021-08-31 02:45:21,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:21,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827699110] [2021-08-31 02:45:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:21,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:21,747 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:21,765 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:21,801 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 02:45:21,801 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 02:45:21,801 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 02:45:21,801 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 02:45:21,801 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 02:45:21,801 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,802 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 02:45:21,802 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 02:45:21,802 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2021-08-31 02:45:21,802 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 02:45:21,802 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 02:45:21,803 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 02:45:21,804 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 02:45:21,808 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 02:45:21,811 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 02:45:21,838 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 02:45:21,839 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 02:45:21,839 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,840 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 02:45:21,841 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 02:45:21,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:21,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:21,863 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 02:45:21,863 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 02:45:21,882 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 02:45:21,882 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,883 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 02:45:21,884 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 02:45:21,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:21,885 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:21,906 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 02:45:21,906 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 02:45:21,925 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 02:45:21,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,926 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 02:45:21,927 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 02:45:21,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:21,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:21,967 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 02:45:21,968 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:21,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:21,968 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 02:45:21,970 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 02:45:21,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 02:45:21,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:22,005 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 02:45:22,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:22,011 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 02:45:22,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 02:45:22,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 02:45:22,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 02:45:22,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 02:45:22,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 02:45:22,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 02:45:22,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2021-08-31 02:45:22,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 02:45:22,012 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 02:45:22,012 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 02:45:22,014 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 02:45:22,018 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 02:45:22,021 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 02:45:22,053 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 02:45:22,054 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 02:45:22,054 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:22,055 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 02:45:22,061 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 02:45:22,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:45:22,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:45:22,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:45:22,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:45:22,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:45:22,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:45:22,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:45:22,071 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 02:45:22,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:45:22,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:22,100 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:22,117 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 02:45:22,118 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 02:45:22,119 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 02:45:22,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:45:22,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:45:22,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:45:22,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:45:22,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:45:22,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:45:22,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:45:22,132 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 02:45:22,134 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 02:45:22,134 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 02:45:22,134 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:22,135 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 02:45:22,136 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 02:45:22,137 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 02:45:22,137 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 02:45:22,137 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 02:45:22,137 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] [2021-08-31 02:45:22,156 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 02:45:22,156 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 02:45:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:22,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 02:45:22,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:22,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 02:45:22,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:22,206 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 02:45:22,206 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 02:45:22,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:22,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 138 states and 145 transitions. Complement of second has 7 states. [2021-08-31 02:45:22,227 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 02:45:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-08-31 02:45:22,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2021-08-31 02:45:22,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:22,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2021-08-31 02:45:22,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:22,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2021-08-31 02:45:22,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:22,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 145 transitions. [2021-08-31 02:45:22,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 02:45:22,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 94 states and 98 transitions. [2021-08-31 02:45:22,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-08-31 02:45:22,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-08-31 02:45:22,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2021-08-31 02:45:22,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 02:45:22,234 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-08-31 02:45:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2021-08-31 02:45:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 51. [2021-08-31 02:45:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 50 states have internal predecessors, (53), 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 02:45:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-08-31 02:45:22,237 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-08-31 02:45:22,237 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-08-31 02:45:22,237 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 02:45:22,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2021-08-31 02:45:22,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 02:45:22,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:45:22,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:45:22,239 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 2, 1, 1, 1, 1] [2021-08-31 02:45:22,239 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 02:45:22,239 INFO L791 eck$LassoCheckResult]: Stem: 876#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(9); 877#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 885#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 886#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 922#L18 assume !(0 == __VERIFIER_assert_~cond); 921#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 920#L18-3 assume !(0 == __VERIFIER_assert_~cond); 880#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 881#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 874#L18 assume !(0 == __VERIFIER_assert_~cond); 875#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 883#L18-3 assume !(0 == __VERIFIER_assert_~cond); 884#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 919#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 918#L18 assume !(0 == __VERIFIER_assert_~cond); 917#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 916#L18-3 assume !(0 == __VERIFIER_assert_~cond); 915#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 914#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 913#L18 assume !(0 == __VERIFIER_assert_~cond); 912#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 911#L18-3 assume !(0 == __VERIFIER_assert_~cond); 910#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 909#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 908#L18 assume !(0 == __VERIFIER_assert_~cond); 907#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 906#L18-3 assume !(0 == __VERIFIER_assert_~cond); 905#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 904#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 903#L18 assume !(0 == __VERIFIER_assert_~cond); 902#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 901#L18-3 assume !(0 == __VERIFIER_assert_~cond); 900#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 899#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 898#L18 assume !(0 == __VERIFIER_assert_~cond); 897#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 896#L18-3 assume !(0 == __VERIFIER_assert_~cond); 895#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 894#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 890#L18 assume !(0 == __VERIFIER_assert_~cond); 893#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 892#L18-3 assume !(0 == __VERIFIER_assert_~cond); 891#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 889#L28-2 assume !(main_~j~0 < 8); 888#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 887#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 879#L28-2 [2021-08-31 02:45:22,239 INFO L793 eck$LassoCheckResult]: Loop: 879#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 872#L18 assume !(0 == __VERIFIER_assert_~cond); 873#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 882#L18-3 assume !(0 == __VERIFIER_assert_~cond); 878#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 879#L28-2 [2021-08-31 02:45:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash 674802632, now seen corresponding path program 2 times [2021-08-31 02:45:22,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:22,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322843159] [2021-08-31 02:45:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:22,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:22,251 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:22,264 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:22,265 INFO L82 PathProgramCache]: Analyzing trace with hash 46025336, now seen corresponding path program 2 times [2021-08-31 02:45:22,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:22,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967898902] [2021-08-31 02:45:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:22,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:22,268 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:22,271 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1573708561, now seen corresponding path program 3 times [2021-08-31 02:45:22,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:45:22,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506179725] [2021-08-31 02:45:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:45:22,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:45:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:22,282 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:45:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:45:22,299 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:45:22,362 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 02:45:22,363 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 02:45:22,363 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 02:45:22,363 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 02:45:22,363 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 02:45:22,363 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,363 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 02:45:22,363 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 02:45:22,363 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2021-08-31 02:45:22,363 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 02:45:22,363 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 02:45:22,364 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 02:45:22,368 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 02:45:22,369 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 02:45:22,372 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 02:45:22,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:22,402 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 02:45:22,402 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 02:45:22,402 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:22,403 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 02:45:22,404 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 02:45:22,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 02:45:22,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:22,443 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 02:45:22,444 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:22,445 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 02:45:22,446 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 02:45:22,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 02:45:22,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 02:45:22,481 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 02:45:22,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:22,487 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 02:45:22,487 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 02:45:22,487 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 02:45:22,487 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 02:45:22,487 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 02:45:22,487 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,488 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 02:45:22,488 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 02:45:22,488 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2021-08-31 02:45:22,488 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 02:45:22,488 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 02:45:22,488 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 02:45:22,492 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 02:45:22,494 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 02:45:22,497 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 02:45:22,527 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 02:45:22,527 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 02:45:22,527 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:22,528 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 02:45:22,529 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 02:45:22,531 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 02:45:22,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:45:22,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:45:22,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:45:22,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:45:22,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:45:22,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:45:22,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:45:22,554 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 02:45:22,557 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 02:45:22,558 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 02:45:22,558 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:45:22,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:45:22,559 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 02:45:22,560 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 02:45:22,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 02:45:22,561 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 02:45:22,561 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 02:45:22,561 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] [2021-08-31 02:45:22,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:22,579 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 02:45:22,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:22,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 02:45:22,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:22,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 02:45:22,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:22,719 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 02:45:22,720 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 02:45:22,720 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:22,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 128 states and 133 transitions. Complement of second has 7 states. [2021-08-31 02:45:22,737 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 02:45:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-08-31 02:45:22,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2021-08-31 02:45:22,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:22,738 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 02:45:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:22,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 02:45:22,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:22,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 02:45:22,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:22,873 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 02:45:22,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 02:45:22,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:22,887 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 128 states and 133 transitions. Complement of second has 7 states. [2021-08-31 02:45:22,887 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 02:45:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-08-31 02:45:22,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2021-08-31 02:45:22,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:22,888 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 02:45:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:45:22,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-08-31 02:45:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:22,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 02:45:22,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:45:23,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 02:45:23,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:45:23,046 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 02:45:23,047 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 02:45:23,047 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:23,070 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 94 transitions. Complement of second has 6 states. [2021-08-31 02:45:23,071 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 02:45:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:45:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2021-08-31 02:45:23,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 5 letters. [2021-08-31 02:45:23,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:23,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 51 letters. Loop has 5 letters. [2021-08-31 02:45:23,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:23,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 10 letters. [2021-08-31 02:45:23,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:45:23,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 94 transitions. [2021-08-31 02:45:23,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 02:45:23,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 0 states and 0 transitions. [2021-08-31 02:45:23,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 02:45:23,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 02:45:23,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 02:45:23,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:45:23,074 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 02:45:23,074 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 02:45:23,074 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 02:45:23,074 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 02:45:23,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 02:45:23,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 02:45:23,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 02:45:23,076 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) 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 02:45:23,079 INFO L158 Benchmark]: Toolchain (without parser) took 4581.75ms. Allocated memory was 50.3MB in the beginning and 100.7MB in the end (delta: 50.3MB). Free memory was 27.9MB in the beginning and 64.5MB in the end (delta: -36.5MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2021-08-31 02:45:23,079 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.5MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:45:23,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.92ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 27.6MB in the beginning and 49.0MB in the end (delta: -21.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2021-08-31 02:45:23,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.36ms. Allocated memory is still 65.0MB. Free memory was 49.0MB in the beginning and 47.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:45:23,080 INFO L158 Benchmark]: Boogie Preprocessor took 24.32ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 46.6MB in the end (delta: 952.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:45:23,080 INFO L158 Benchmark]: RCFGBuilder took 191.56ms. Allocated memory is still 65.0MB. Free memory was 46.4MB in the beginning and 38.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-31 02:45:23,080 INFO L158 Benchmark]: BuchiAutomizer took 4054.26ms. Allocated memory was 65.0MB in the beginning and 100.7MB in the end (delta: 35.7MB). Free memory was 38.1MB in the beginning and 64.5MB in the end (delta: -26.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2021-08-31 02:45:23,081 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.14ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.5MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.92ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 27.6MB in the beginning and 49.0MB in the end (delta: -21.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.36ms. Allocated memory is still 65.0MB. Free memory was 49.0MB in the beginning and 47.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.32ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 46.6MB in the end (delta: 952.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 191.56ms. Allocated memory is still 65.0MB. Free memory was 46.4MB in the beginning and 38.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 4054.26ms. Allocated memory was 65.0MB in the beginning and 100.7MB in the end (delta: 35.7MB). Free memory was 38.1MB in the beginning and 64.5MB in the end (delta: -26.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function nlen + -1 * i and consists of 3 locations. One deterministic module has affine ranking function 15 + -2 * j and consists of 4 locations. One nondeterministic module has affine ranking function 15 + -2 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 02:45:23,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:23,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-31 02:45:23,517 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...