./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 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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 Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 19:13:01,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 19:13:01,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 19:13:01,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 19:13:01,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 19:13:01,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 19:13:01,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 19:13:01,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 19:13:01,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 19:13:01,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 19:13:01,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 19:13:01,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 19:13:01,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 19:13:01,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 19:13:01,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 19:13:01,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 19:13:01,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 19:13:01,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 19:13:01,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 19:13:01,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 19:13:01,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 19:13:01,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 19:13:01,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 19:13:01,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 19:13:01,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 19:13:01,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 19:13:01,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 19:13:01,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 19:13:01,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 19:13:01,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 19:13:01,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 19:13:01,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 19:13:01,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 19:13:01,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 19:13:01,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 19:13:01,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 19:13:01,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 19:13:01,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 19:13:01,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 19:13:01,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 19:13:01,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 19:13:01,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 19:13:01,907 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 19:13:01,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 19:13:01,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 19:13:01,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 19:13:01,912 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 19:13:01,913 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 19:13:01,913 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 19:13:01,914 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 19:13:01,915 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 19:13:01,915 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 19:13:01,915 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 19:13:01,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 19:13:01,916 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 19:13:01,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 19:13:01,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 19:13:01,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 19:13:01,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 19:13:01,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 19:13:01,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 19:13:01,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 19:13:01,919 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 19:13:01,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 19:13:01,920 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 19:13:01,920 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 19:13:01,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 19:13:01,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 19:13:01,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 19:13:01,921 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 19:13:01,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 19:13:01,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 19:13:01,922 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 19:13:01,923 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 19:13:01,924 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 19:13:01,925 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 [2020-10-19 19:13:02,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 19:13:02,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 19:13:02,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 19:13:02,234 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 19:13:02,235 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 19:13:02,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2020-10-19 19:13:02,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48bd3f9f/255e78aae5684c2e94dc3fa72c853976/FLAG7b82c4cfa [2020-10-19 19:13:02,739 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 19:13:02,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2020-10-19 19:13:02,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48bd3f9f/255e78aae5684c2e94dc3fa72c853976/FLAG7b82c4cfa [2020-10-19 19:13:03,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48bd3f9f/255e78aae5684c2e94dc3fa72c853976 [2020-10-19 19:13:03,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 19:13:03,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 19:13:03,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 19:13:03,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 19:13:03,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 19:13:03,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f420319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03, skipping insertion in model container [2020-10-19 19:13:03,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 19:13:03,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 19:13:03,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:13:03,378 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 19:13:03,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:13:03,406 INFO L208 MainTranslator]: Completed translation [2020-10-19 19:13:03,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03 WrapperNode [2020-10-19 19:13:03,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 19:13:03,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 19:13:03,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 19:13:03,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 19:13:03,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 19:13:03,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 19:13:03,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 19:13:03,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 19:13:03,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... [2020-10-19 19:13:03,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 19:13:03,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 19:13:03,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 19:13:03,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 19:13:03,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 19:13:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 19:13:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 19:13:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 19:13:03,786 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 19:13:03,787 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-19 19:13:03,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:13:03 BoogieIcfgContainer [2020-10-19 19:13:03,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 19:13:03,790 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 19:13:03,790 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 19:13:03,794 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 19:13:03,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:13:03,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 07:13:03" (1/3) ... [2020-10-19 19:13:03,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@484e32c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:13:03, skipping insertion in model container [2020-10-19 19:13:03,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:13:03,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:13:03" (2/3) ... [2020-10-19 19:13:03,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@484e32c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:13:03, skipping insertion in model container [2020-10-19 19:13:03,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:13:03,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:13:03" (3/3) ... [2020-10-19 19:13:03,800 INFO L373 chiAutomizerObserver]: Analyzing ICFG id_build.i [2020-10-19 19:13:03,859 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 19:13:03,859 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 19:13:03,860 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 19:13:03,860 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 19:13:03,860 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 19:13:03,861 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 19:13:03,861 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 19:13:03,861 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 19:13:03,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-10-19 19:13:03,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-19 19:13:03,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:03,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:03,915 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:03,915 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:13:03,915 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 19:13:03,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-10-19 19:13:03,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-19 19:13:03,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:03,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:03,918 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:03,918 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:13:03,927 INFO L794 eck$LassoCheckResult]: Stem: 13#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); 11#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; 19#L27-3true [2020-10-19 19:13:03,927 INFO L796 eck$LassoCheckResult]: Loop: 19#L27-3true assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 4#L28-2true assume !(main_~j~0 < 8); 21#L27-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 19#L27-3true [2020-10-19 19:13:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 19:13:03,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:03,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553597488] [2020-10-19 19:13:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,084 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 39954, now seen corresponding path program 1 times [2020-10-19 19:13:04,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365521697] [2020-10-19 19:13:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365521697] [2020-10-19 19:13:04,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:13:04,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 19:13:04,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626463146] [2020-10-19 19:13:04,139 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:04,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:04,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 19:13:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 19:13:04,152 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-10-19 19:13:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:04,195 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-10-19 19:13:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 19:13:04,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2020-10-19 19:13:04,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-19 19:13:04,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 14 states and 15 transitions. [2020-10-19 19:13:04,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 19:13:04,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 19:13:04,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2020-10-19 19:13:04,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:04,208 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-10-19 19:13:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2020-10-19 19:13:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2020-10-19 19:13:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-19 19:13:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-10-19 19:13:04,230 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-19 19:13:04,230 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-19 19:13:04,230 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 19:13:04,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-10-19 19:13:04,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 19:13:04,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:04,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:04,232 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:04,232 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:13:04,232 INFO L794 eck$LassoCheckResult]: Stem: 61#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); 56#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; 57#L27-3 [2020-10-19 19:13:04,233 INFO L796 eck$LassoCheckResult]: Loop: 57#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 58#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; 59#L18 assume !(0 == __VERIFIER_assert_~cond); 60#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; 54#L18-3 assume !(0 == __VERIFIER_assert_~cond); 55#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 62#L28-2 assume !(main_~j~0 < 8); 63#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 57#L27-3 [2020-10-19 19:13:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,233 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-19 19:13:04,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307876194] [2020-10-19 19:13:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,258 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1814055911, now seen corresponding path program 1 times [2020-10-19 19:13:04,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059444899] [2020-10-19 19:13:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059444899] [2020-10-19 19:13:04,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776829023] [2020-10-19 19:13:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:13:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:04,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 19:13:04,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:13:04,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-10-19 19:13:04,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71283615] [2020-10-19 19:13:04,426 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:04,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:04,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 19:13:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 19:13:04,427 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-10-19 19:13:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:04,452 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-10-19 19:13:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 19:13:04,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2020-10-19 19:13:04,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-10-19 19:13:04,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2020-10-19 19:13:04,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-19 19:13:04,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-19 19:13:04,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2020-10-19 19:13:04,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:04,457 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-19 19:13:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2020-10-19 19:13:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2020-10-19 19:13:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 19:13:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-10-19 19:13:04,460 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 19:13:04,460 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 19:13:04,460 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 19:13:04,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-10-19 19:13:04,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-19 19:13:04,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:04,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:04,462 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:04,462 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2020-10-19 19:13:04,463 INFO L794 eck$LassoCheckResult]: Stem: 118#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); 113#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; 114#L27-3 [2020-10-19 19:13:04,463 INFO L796 eck$LassoCheckResult]: Loop: 114#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 120#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; 125#L18 assume !(0 == __VERIFIER_assert_~cond); 124#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; 123#L18-3 assume !(0 == __VERIFIER_assert_~cond); 119#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 115#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; 116#L18 assume !(0 == __VERIFIER_assert_~cond); 117#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; 111#L18-3 assume !(0 == __VERIFIER_assert_~cond); 112#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 122#L28-2 assume !(main_~j~0 < 8); 121#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 114#L27-3 [2020-10-19 19:13:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-19 19:13:04,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75398267] [2020-10-19 19:13:04,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,487 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1818130318, now seen corresponding path program 2 times [2020-10-19 19:13:04,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54821290] [2020-10-19 19:13:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54821290] [2020-10-19 19:13:04,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419309588] [2020-10-19 19:13:04,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:13:04,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 19:13:04,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:13:04,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:04,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:13:04,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-19 19:13:04,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987526646] [2020-10-19 19:13:04,598 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:04,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:13:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:13:04,599 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-10-19 19:13:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:04,627 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-10-19 19:13:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:13:04,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2020-10-19 19:13:04,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-10-19 19:13:04,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2020-10-19 19:13:04,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-19 19:13:04,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 19:13:04,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2020-10-19 19:13:04,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:04,631 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-10-19 19:13:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2020-10-19 19:13:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-10-19 19:13:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 19:13:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-10-19 19:13:04,634 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-10-19 19:13:04,634 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-10-19 19:13:04,634 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 19:13:04,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2020-10-19 19:13:04,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-10-19 19:13:04,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:04,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:04,635 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:04,636 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 1, 1, 1] [2020-10-19 19:13:04,636 INFO L794 eck$LassoCheckResult]: Stem: 200#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); 196#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; 197#L27-3 [2020-10-19 19:13:04,636 INFO L796 eck$LassoCheckResult]: Loop: 197#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 203#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; 213#L18 assume !(0 == __VERIFIER_assert_~cond); 212#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; 211#L18-3 assume !(0 == __VERIFIER_assert_~cond); 202#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 198#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; 199#L18 assume !(0 == __VERIFIER_assert_~cond); 201#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; 194#L18-3 assume !(0 == __VERIFIER_assert_~cond); 195#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 210#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; 206#L18 assume !(0 == __VERIFIER_assert_~cond); 209#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; 208#L18-3 assume !(0 == __VERIFIER_assert_~cond); 207#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 205#L28-2 assume !(main_~j~0 < 8); 204#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 197#L27-3 [2020-10-19 19:13:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,636 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-19 19:13:04,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164895626] [2020-10-19 19:13:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,657 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:04,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1614576711, now seen corresponding path program 3 times [2020-10-19 19:13:04,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668621150] [2020-10-19 19:13:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668621150] [2020-10-19 19:13:04,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450178849] [2020-10-19 19:13:04,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:13:04,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 19:13:04,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:13:04,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 19:13:04,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:13:04,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-19 19:13:04,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125200815] [2020-10-19 19:13:04,807 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:04,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 19:13:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 19:13:04,808 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-19 19:13:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:04,838 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-10-19 19:13:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 19:13:04,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2020-10-19 19:13:04,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-10-19 19:13:04,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2020-10-19 19:13:04,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-19 19:13:04,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-10-19 19:13:04,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2020-10-19 19:13:04,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:04,843 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-10-19 19:13:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2020-10-19 19:13:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-10-19 19:13:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 19:13:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-10-19 19:13:04,847 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-19 19:13:04,847 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-19 19:13:04,847 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 19:13:04,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-10-19 19:13:04,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-19 19:13:04,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:04,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:04,849 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:04,850 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 1, 1, 1] [2020-10-19 19:13:04,850 INFO L794 eck$LassoCheckResult]: Stem: 309#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); 303#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; 304#L27-3 [2020-10-19 19:13:04,850 INFO L796 eck$LassoCheckResult]: Loop: 304#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 312#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; 327#L18 assume !(0 == __VERIFIER_assert_~cond); 326#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; 325#L18-3 assume !(0 == __VERIFIER_assert_~cond); 311#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 307#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; 308#L18 assume !(0 == __VERIFIER_assert_~cond); 310#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; 305#L18-3 assume !(0 == __VERIFIER_assert_~cond); 306#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 324#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; 323#L18 assume !(0 == __VERIFIER_assert_~cond); 322#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; 321#L18-3 assume !(0 == __VERIFIER_assert_~cond); 320#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 319#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; 315#L18 assume !(0 == __VERIFIER_assert_~cond); 318#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; 317#L18-3 assume !(0 == __VERIFIER_assert_~cond); 316#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 314#L28-2 assume !(main_~j~0 < 8); 313#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 304#L27-3 [2020-10-19 19:13:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-19 19:13:04,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361769263] [2020-10-19 19:13:04,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:04,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:04,871 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -909214510, now seen corresponding path program 4 times [2020-10-19 19:13:04,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:04,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959360682] [2020-10-19 19:13:04,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:04,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959360682] [2020-10-19 19:13:04,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882368495] [2020-10-19 19:13:04,942 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:13:04,990 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 19:13:04,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:13:04,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 19:13:04,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:13:05,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-19 19:13:05,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974424342] [2020-10-19 19:13:05,021 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:05,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 19:13:05,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 19:13:05,022 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 7 states. [2020-10-19 19:13:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:05,054 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-10-19 19:13:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 19:13:05,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2020-10-19 19:13:05,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-10-19 19:13:05,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 35 transitions. [2020-10-19 19:13:05,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-10-19 19:13:05,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-10-19 19:13:05,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 35 transitions. [2020-10-19 19:13:05,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:05,059 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-10-19 19:13:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 35 transitions. [2020-10-19 19:13:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2020-10-19 19:13:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-19 19:13:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-10-19 19:13:05,062 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-10-19 19:13:05,063 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-10-19 19:13:05,063 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 19:13:05,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2020-10-19 19:13:05,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-10-19 19:13:05,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:05,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:05,065 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:05,065 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 1, 1, 1] [2020-10-19 19:13:05,065 INFO L794 eck$LassoCheckResult]: Stem: 444#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); 438#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; 439#L27-3 [2020-10-19 19:13:05,066 INFO L796 eck$LassoCheckResult]: Loop: 439#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 447#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; 467#L18 assume !(0 == __VERIFIER_assert_~cond); 466#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; 465#L18-3 assume !(0 == __VERIFIER_assert_~cond); 446#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 442#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; 443#L18 assume !(0 == __VERIFIER_assert_~cond); 445#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; 440#L18-3 assume !(0 == __VERIFIER_assert_~cond); 441#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 464#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; 463#L18 assume !(0 == __VERIFIER_assert_~cond); 462#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; 461#L18-3 assume !(0 == __VERIFIER_assert_~cond); 460#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 459#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; 458#L18 assume !(0 == __VERIFIER_assert_~cond); 457#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; 456#L18-3 assume !(0 == __VERIFIER_assert_~cond); 455#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 454#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; 450#L18 assume !(0 == __VERIFIER_assert_~cond); 453#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; 452#L18-3 assume !(0 == __VERIFIER_assert_~cond); 451#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 449#L28-2 assume !(main_~j~0 < 8); 448#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 439#L27-3 [2020-10-19 19:13:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-19 19:13:05,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621930087] [2020-10-19 19:13:05,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,085 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1734363993, now seen corresponding path program 5 times [2020-10-19 19:13:05,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208074112] [2020-10-19 19:13:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208074112] [2020-10-19 19:13:05,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214333311] [2020-10-19 19:13:05,166 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:13:05,211 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-19 19:13:05,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:13:05,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 19:13:05,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:13:05,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-19 19:13:05,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346458549] [2020-10-19 19:13:05,243 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:05,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 19:13:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 19:13:05,244 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-10-19 19:13:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:05,280 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-10-19 19:13:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 19:13:05,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2020-10-19 19:13:05,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-10-19 19:13:05,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 40 transitions. [2020-10-19 19:13:05,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-10-19 19:13:05,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-10-19 19:13:05,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 40 transitions. [2020-10-19 19:13:05,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:05,284 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-19 19:13:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 40 transitions. [2020-10-19 19:13:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-10-19 19:13:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 19:13:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-10-19 19:13:05,288 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-10-19 19:13:05,288 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-10-19 19:13:05,288 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 19:13:05,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 36 transitions. [2020-10-19 19:13:05,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-19 19:13:05,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:05,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:05,290 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:05,291 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 1, 1, 1] [2020-10-19 19:13:05,291 INFO L794 eck$LassoCheckResult]: Stem: 606#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); 601#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; 602#L27-3 [2020-10-19 19:13:05,291 INFO L796 eck$LassoCheckResult]: Loop: 602#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 608#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; 633#L18 assume !(0 == __VERIFIER_assert_~cond); 632#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; 631#L18-3 assume !(0 == __VERIFIER_assert_~cond); 607#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 603#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; 604#L18 assume !(0 == __VERIFIER_assert_~cond); 605#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; 599#L18-3 assume !(0 == __VERIFIER_assert_~cond); 600#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 630#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; 629#L18 assume !(0 == __VERIFIER_assert_~cond); 628#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; 627#L18-3 assume !(0 == __VERIFIER_assert_~cond); 626#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 625#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; 624#L18 assume !(0 == __VERIFIER_assert_~cond); 623#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; 622#L18-3 assume !(0 == __VERIFIER_assert_~cond); 621#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 620#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; 619#L18 assume !(0 == __VERIFIER_assert_~cond); 618#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; 617#L18-3 assume !(0 == __VERIFIER_assert_~cond); 616#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 615#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; 611#L18 assume !(0 == __VERIFIER_assert_~cond); 614#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; 613#L18-3 assume !(0 == __VERIFIER_assert_~cond); 612#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 610#L28-2 assume !(main_~j~0 < 8); 609#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 602#L27-3 [2020-10-19 19:13:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-19 19:13:05,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208130732] [2020-10-19 19:13:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,308 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,309 INFO L82 PathProgramCache]: Analyzing trace with hash 152926514, now seen corresponding path program 6 times [2020-10-19 19:13:05,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982979936] [2020-10-19 19:13:05,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982979936] [2020-10-19 19:13:05,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198927480] [2020-10-19 19:13:05,451 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:13:05,500 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-19 19:13:05,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:13:05,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 19:13:05,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:13:05,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-19 19:13:05,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467845768] [2020-10-19 19:13:05,533 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:05,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:05,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 19:13:05,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-19 19:13:05,534 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. cyclomatic complexity: 2 Second operand 9 states. [2020-10-19 19:13:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:05,574 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-19 19:13:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 19:13:05,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 45 transitions. [2020-10-19 19:13:05,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-10-19 19:13:05,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 45 transitions. [2020-10-19 19:13:05,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-19 19:13:05,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-19 19:13:05,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 45 transitions. [2020-10-19 19:13:05,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:05,578 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-10-19 19:13:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 45 transitions. [2020-10-19 19:13:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-10-19 19:13:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-19 19:13:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-10-19 19:13:05,582 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-10-19 19:13:05,582 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-10-19 19:13:05,582 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 19:13:05,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 41 transitions. [2020-10-19 19:13:05,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-19 19:13:05,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:05,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:05,584 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:05,584 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 1, 1, 1] [2020-10-19 19:13:05,585 INFO L794 eck$LassoCheckResult]: Stem: 793#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); 788#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; 789#L27-3 [2020-10-19 19:13:05,585 INFO L796 eck$LassoCheckResult]: Loop: 789#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 795#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; 825#L18 assume !(0 == __VERIFIER_assert_~cond); 824#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; 823#L18-3 assume !(0 == __VERIFIER_assert_~cond); 794#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 790#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; 791#L18 assume !(0 == __VERIFIER_assert_~cond); 792#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; 786#L18-3 assume !(0 == __VERIFIER_assert_~cond); 787#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 822#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; 821#L18 assume !(0 == __VERIFIER_assert_~cond); 820#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; 819#L18-3 assume !(0 == __VERIFIER_assert_~cond); 818#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 817#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; 816#L18 assume !(0 == __VERIFIER_assert_~cond); 815#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; 814#L18-3 assume !(0 == __VERIFIER_assert_~cond); 813#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 812#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; 811#L18 assume !(0 == __VERIFIER_assert_~cond); 810#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; 809#L18-3 assume !(0 == __VERIFIER_assert_~cond); 808#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 807#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; 806#L18 assume !(0 == __VERIFIER_assert_~cond); 805#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; 804#L18-3 assume !(0 == __VERIFIER_assert_~cond); 803#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 802#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; 798#L18 assume !(0 == __VERIFIER_assert_~cond); 801#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; 800#L18-3 assume !(0 == __VERIFIER_assert_~cond); 799#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 797#L28-2 assume !(main_~j~0 < 8); 796#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 789#L27-3 [2020-10-19 19:13:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-19 19:13:05,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554109684] [2020-10-19 19:13:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,600 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,601 INFO L82 PathProgramCache]: Analyzing trace with hash 836766457, now seen corresponding path program 7 times [2020-10-19 19:13:05,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430525192] [2020-10-19 19:13:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430525192] [2020-10-19 19:13:05,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089254192] [2020-10-19 19:13:05,696 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:13:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:05,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 19:13:05,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:05,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:13:05,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-19 19:13:05,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824209467] [2020-10-19 19:13:05,767 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:13:05,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:13:05,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 19:13:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-19 19:13:05,768 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-10-19 19:13:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:13:05,809 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-10-19 19:13:05,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 19:13:05,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2020-10-19 19:13:05,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-10-19 19:13:05,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2020-10-19 19:13:05,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-10-19 19:13:05,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-10-19 19:13:05,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2020-10-19 19:13:05,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:05,813 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-19 19:13:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2020-10-19 19:13:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-19 19:13:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-19 19:13:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-10-19 19:13:05,818 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-19 19:13:05,818 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-19 19:13:05,818 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 19:13:05,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 46 transitions. [2020-10-19 19:13:05,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-10-19 19:13:05,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:05,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:05,821 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:13:05,821 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 1, 1, 1] [2020-10-19 19:13:05,821 INFO L794 eck$LassoCheckResult]: Stem: 1002#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); 997#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; 998#L27-3 [2020-10-19 19:13:05,822 INFO L796 eck$LassoCheckResult]: Loop: 998#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1004#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; 1039#L18 assume !(0 == __VERIFIER_assert_~cond); 1038#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; 1037#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1003#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 999#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; 1000#L18 assume !(0 == __VERIFIER_assert_~cond); 1001#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; 995#L18-3 assume !(0 == __VERIFIER_assert_~cond); 996#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1036#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; 1035#L18 assume !(0 == __VERIFIER_assert_~cond); 1034#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; 1033#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1032#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1031#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; 1030#L18 assume !(0 == __VERIFIER_assert_~cond); 1029#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; 1028#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1027#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1026#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; 1025#L18 assume !(0 == __VERIFIER_assert_~cond); 1024#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; 1023#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1022#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1021#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; 1020#L18 assume !(0 == __VERIFIER_assert_~cond); 1019#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; 1018#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1017#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1016#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; 1015#L18 assume !(0 == __VERIFIER_assert_~cond); 1014#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; 1013#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1012#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1011#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; 1007#L18 assume !(0 == __VERIFIER_assert_~cond); 1010#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; 1009#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1008#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1006#L28-2 assume !(main_~j~0 < 8); 1005#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 998#L27-3 [2020-10-19 19:13:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-19 19:13:05,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580484170] [2020-10-19 19:13:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,836 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -190546542, now seen corresponding path program 8 times [2020-10-19 19:13:05,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578382130] [2020-10-19 19:13:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,870 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1896379536, now seen corresponding path program 1 times [2020-10-19 19:13:05,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:05,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953644927] [2020-10-19 19:13:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:05,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:05,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:06,403 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 107 [2020-10-19 19:13:06,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:06,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:06,478 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:06,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:06,479 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:06,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:06,480 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:06,480 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,480 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:06,480 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:06,480 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration9_Loop [2020-10-19 19:13:06,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:06,481 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:06,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,591 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:06,591 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:06,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:06,606 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:06,607 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:06,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:06,653 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:06,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:06,711 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,803 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:06,806 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:06,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:06,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:06,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:06,807 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:06,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:06,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:06,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:06,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration9_Loop [2020-10-19 19:13:06,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:06,808 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:06,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:06,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:07,029 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:07,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:07,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:07,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:07,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:07,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:07,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:07,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:07,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:07,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:07,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:07,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:07,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:07,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:07,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:07,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:07,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:07,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:07,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:07,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:07,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:07,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:07,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:07,144 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,152 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-19 19:13:07,152 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:07,164 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:07,164 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:13:07,165 INFO L512 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 [] Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,203 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:07,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:07,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:07,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:07,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2020-10-19 19:13:07,280 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 [2020-10-19 19:13:07,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-10-19 19:13:07,318 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 88 states and 91 transitions. Complement of second has 4 states. [2020-10-19 19:13:07,318 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 [2020-10-19 19:13:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:13:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-10-19 19:13:07,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 43 letters. [2020-10-19 19:13:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 45 letters. Loop has 43 letters. [2020-10-19 19:13:07,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:07,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 86 letters. [2020-10-19 19:13:07,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:07,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 91 transitions. [2020-10-19 19:13:07,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 19:13:07,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 90 transitions. [2020-10-19 19:13:07,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2020-10-19 19:13:07,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-19 19:13:07,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 90 transitions. [2020-10-19 19:13:07,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:07,329 INFO L691 BuchiCegarLoop]: Abstraction has 87 states and 90 transitions. [2020-10-19 19:13:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 90 transitions. [2020-10-19 19:13:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2020-10-19 19:13:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-19 19:13:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-10-19 19:13:07,332 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-10-19 19:13:07,332 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-10-19 19:13:07,332 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 19:13:07,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 54 transitions. [2020-10-19 19:13:07,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 19:13:07,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:07,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:07,334 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 19:13:07,334 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:13:07,334 INFO L794 eck$LassoCheckResult]: Stem: 1293#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); 1283#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; 1284#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1289#L28-2 [2020-10-19 19:13:07,334 INFO L796 eck$LassoCheckResult]: Loop: 1289#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; 1290#L18 assume !(0 == __VERIFIER_assert_~cond); 1294#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; 1285#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1286#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1289#L28-2 [2020-10-19 19:13:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2020-10-19 19:13:07,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:07,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101283241] [2020-10-19 19:13:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:07,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:07,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:07,347 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash 46241048, now seen corresponding path program 1 times [2020-10-19 19:13:07,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:07,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732520211] [2020-10-19 19:13:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:07,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:07,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:07,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash 271456306, now seen corresponding path program 1 times [2020-10-19 19:13:07,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:07,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260233704] [2020-10-19 19:13:07,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:07,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:07,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:07,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:07,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:07,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:07,434 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:07,434 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:07,434 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:07,434 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:07,434 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:07,435 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,435 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:07,435 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:07,435 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration10_Loop [2020-10-19 19:13:07,435 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:07,435 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:07,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,499 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:07,499 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:07,510 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,514 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:07,514 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Honda state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:07,561 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:07,566 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:07,611 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,614 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:07,614 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:07,658 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:07,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:07,733 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:07,735 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:07,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:07,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:07,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:07,736 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:07,736 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,736 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:07,736 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:07,736 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration10_Loop [2020-10-19 19:13:07,736 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:07,736 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:07,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:07,799 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:07,799 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:07,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:07,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:07,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:07,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:07,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:07,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:07,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:07,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:07,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:07,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:07,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:07,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:07,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:07,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:07,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:07,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:07,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:07,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:07,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:07,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:07,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:07,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:13:07,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 19:13:07,912 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:07,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:07,927 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:07,927 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:13:07,927 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:07,963 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:07,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:07,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:07,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:07,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:07,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:08,002 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 [2020-10-19 19:13:08,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-19 19:13:08,019 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 138 states and 145 transitions. Complement of second has 7 states. [2020-10-19 19:13:08,020 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 [2020-10-19 19:13:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:13:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-19 19:13:08,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2020-10-19 19:13:08,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2020-10-19 19:13:08,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2020-10-19 19:13:08,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 145 transitions. [2020-10-19 19:13:08,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 19:13:08,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 94 states and 98 transitions. [2020-10-19 19:13:08,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 19:13:08,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-19 19:13:08,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2020-10-19 19:13:08,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:13:08,026 INFO L691 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2020-10-19 19:13:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2020-10-19 19:13:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 51. [2020-10-19 19:13:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-19 19:13:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-10-19 19:13:08,030 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-10-19 19:13:08,030 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-10-19 19:13:08,030 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 19:13:08,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2020-10-19 19:13:08,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 19:13:08,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:13:08,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:13:08,032 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 2, 1, 1, 1, 1] [2020-10-19 19:13:08,032 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:13:08,032 INFO L794 eck$LassoCheckResult]: Stem: 1532#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); 1524#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; 1525#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1534#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; 1570#L18 assume !(0 == __VERIFIER_assert_~cond); 1569#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; 1568#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1533#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1528#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; 1529#L18 assume !(0 == __VERIFIER_assert_~cond); 1531#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; 1522#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1523#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1567#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; 1566#L18 assume !(0 == __VERIFIER_assert_~cond); 1565#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; 1564#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1563#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1562#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; 1561#L18 assume !(0 == __VERIFIER_assert_~cond); 1560#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; 1559#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1558#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1557#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; 1556#L18 assume !(0 == __VERIFIER_assert_~cond); 1555#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; 1554#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1553#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1552#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; 1551#L18 assume !(0 == __VERIFIER_assert_~cond); 1550#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; 1549#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1548#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1547#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; 1546#L18 assume !(0 == __VERIFIER_assert_~cond); 1545#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; 1544#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1543#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1542#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; 1538#L18 assume !(0 == __VERIFIER_assert_~cond); 1541#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; 1540#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1539#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1537#L28-2 assume !(main_~j~0 < 8); 1536#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1535#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1526#L28-2 [2020-10-19 19:13:08,032 INFO L796 eck$LassoCheckResult]: Loop: 1526#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; 1527#L18 assume !(0 == __VERIFIER_assert_~cond); 1530#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; 1520#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1521#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1526#L28-2 [2020-10-19 19:13:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1341776518, now seen corresponding path program 2 times [2020-10-19 19:13:08,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:08,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988300382] [2020-10-19 19:13:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,065 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 46241048, now seen corresponding path program 2 times [2020-10-19 19:13:08,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:08,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41680200] [2020-10-19 19:13:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,075 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1317012673, now seen corresponding path program 3 times [2020-10-19 19:13:08,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:13:08,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928632185] [2020-10-19 19:13:08,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:13:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:13:08,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:13:08,112 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:13:08,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-19 19:13:08,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:13:08,166 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:08,166 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:08,166 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:08,166 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:08,166 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 19:13:08,166 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,166 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:08,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:08,167 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration11_Loop [2020-10-19 19:13:08,167 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:08,167 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:08,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,230 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:08,230 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:08,239 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,243 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:08,244 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:08,295 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,299 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:08,299 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:08,336 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,341 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 19:13:08,341 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Honda state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 19:13:08,372 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 19:13:08,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 19:13:08,433 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 19:13:08,436 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:13:08,436 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:13:08,436 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:13:08,437 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:13:08,437 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:13:08,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:13:08,438 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:13:08,438 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration11_Loop [2020-10-19 19:13:08,438 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:13:08,438 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:13:08,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:13:08,502 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:13:08,502 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:08,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:08,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:08,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:08,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:08,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:08,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:08,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:08,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:08,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:08,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:08,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:08,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:08,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:08,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:08,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:08,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:08,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:08,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:08,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:08,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:13:08,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:13:08,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:13:08,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:13:08,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:13:08,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:13:08,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:13:08,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:13:08,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:13:08,647 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 19:13:08,647 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:13:08,651 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:13:08,651 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 19:13:08,651 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:13:08,651 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:13:08,684 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 19:13:08,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:08,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:08,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:08,740 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 [2020-10-19 19:13:08,740 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-19 19:13:08,755 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 128 states and 133 transitions. Complement of second has 7 states. [2020-10-19 19:13:08,756 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 [2020-10-19 19:13:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:13:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-19 19:13:08,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2020-10-19 19:13:08,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,757 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 19:13:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:08,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:08,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:08,811 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 [2020-10-19 19:13:08,811 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-19 19:13:08,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 128 states and 133 transitions. Complement of second has 7 states. [2020-10-19 19:13:08,823 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 [2020-10-19 19:13:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:13:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-19 19:13:08,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2020-10-19 19:13:08,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,824 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 19:13:08,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:13:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:13:08,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:13:08,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:13:08,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:13:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:13:08,883 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 [2020-10-19 19:13:08,883 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-19 19:13:08,896 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 90 states and 94 transitions. Complement of second has 6 states. [2020-10-19 19:13:08,897 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 [2020-10-19 19:13:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:13:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-19 19:13:08,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 5 letters. [2020-10-19 19:13:08,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 51 letters. Loop has 5 letters. [2020-10-19 19:13:08,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 10 letters. [2020-10-19 19:13:08,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:13:08,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 94 transitions. [2020-10-19 19:13:08,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:13:08,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 0 states and 0 transitions. [2020-10-19 19:13:08,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 19:13:08,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 19:13:08,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 19:13:08,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:13:08,901 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:13:08,901 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:13:08,901 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:13:08,901 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 19:13:08,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 19:13:08,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:13:08,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 19:13:08,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 07:13:08 BoogieIcfgContainer [2020-10-19 19:13:08,909 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 19:13:08,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 19:13:08,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 19:13:08,909 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 19:13:08,910 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:13:03" (3/4) ... [2020-10-19 19:13:08,913 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 19:13:08,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 19:13:08,915 INFO L168 Benchmark]: Toolchain (without parser) took 5794.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 958.6 MB in the beginning and 890.1 MB in the end (delta: 68.6 MB). Peak memory consumption was 284.0 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:08,915 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:13:08,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.86 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:08,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:08,917 INFO L168 Benchmark]: Boogie Preprocessor took 22.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:08,917 INFO L168 Benchmark]: RCFGBuilder took 261.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:08,918 INFO L168 Benchmark]: BuchiAutomizer took 5118.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 890.1 MB in the end (delta: 214.0 MB). Peak memory consumption was 294.8 MB. Max. memory is 11.5 GB. [2020-10-19 19:13:08,918 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 1.2 GB. Free memory is still 890.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:13:08,921 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.86 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 261.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5118.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 890.1 MB in the end (delta: 214.0 MB). Peak memory consumption was 294.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.25 ms. Allocated memory is still 1.2 GB. Free memory is still 890.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (8 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 -2 * j + 15 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 4.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 107 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 51 states and ocurred in iteration 9. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 148/148 HoareTripleCheckerStatistics: 117 SDtfs, 199 SDslu, 195 SDs, 0 SdLazy, 187 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq135 hnf94 smp100 dnf100 smp100 tf112 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...