./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 860b8b475b7671f4fb04d10fe02f66a14a39a96b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:42:36,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:42:36,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:42:36,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:42:36,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:42:36,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:42:36,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:42:36,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:42:36,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:42:36,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:42:36,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:42:36,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:42:36,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:42:36,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:42:36,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:42:36,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:42:36,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:42:36,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:42:36,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:42:36,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:42:36,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:42:36,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:42:36,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:42:36,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:42:36,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:42:36,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:42:36,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:42:36,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:42:36,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:42:36,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:42:36,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:42:36,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:42:36,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:42:36,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:42:36,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:42:36,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:42:36,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:42:36,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:42:36,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:42:36,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:42:36,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:42:36,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 01:42:36,484 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:42:36,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:42:36,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:42:36,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:42:36,486 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:42:36,487 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:42:36,487 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:42:36,487 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:42:36,487 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:42:36,487 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:42:36,488 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:42:36,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:42:36,488 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:42:36,488 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:42:36,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:42:36,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:42:36,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:42:36,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:42:36,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:42:36,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:42:36,490 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:42:36,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:42:36,490 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:42:36,490 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:42:36,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:42:36,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:42:36,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:42:36,491 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:42:36,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:42:36,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:42:36,492 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:42:36,492 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:42:36,493 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:42:36,493 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 -> 860b8b475b7671f4fb04d10fe02f66a14a39a96b [2020-07-29 01:42:36,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:42:36,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:42:36,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:42:36,796 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:42:36,796 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:42:36,797 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2020-07-29 01:42:36,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b42533f9/98bba2184d9e41118b60dfdc4412de3d/FLAGbbce9ae0a [2020-07-29 01:42:37,246 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:42:37,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2020-07-29 01:42:37,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b42533f9/98bba2184d9e41118b60dfdc4412de3d/FLAGbbce9ae0a [2020-07-29 01:42:37,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b42533f9/98bba2184d9e41118b60dfdc4412de3d [2020-07-29 01:42:37,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:42:37,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:42:37,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:42:37,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:42:37,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:42:37,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:37,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d085cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37, skipping insertion in model container [2020-07-29 01:42:37,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:37,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:42:37,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:42:37,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:42:37,881 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:42:37,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:42:37,926 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:42:37,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37 WrapperNode [2020-07-29 01:42:37,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:42:37,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:42:37,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:42:37,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:42:37,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:42:38,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:42:38,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:42:38,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:42:38,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (1/1) ... [2020-07-29 01:42:38,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:42:38,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:42:38,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:42:38,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:42:38,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (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-07-29 01:42:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:42:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:42:38,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:42:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:42:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:42:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:42:38,506 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:42:38,506 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:42:38,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:42:38 BoogieIcfgContainer [2020-07-29 01:42:38,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:42:38,511 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:42:38,511 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:42:38,515 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:42:38,516 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:38,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:42:37" (1/3) ... [2020-07-29 01:42:38,518 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7376822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:42:38, skipping insertion in model container [2020-07-29 01:42:38,518 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:38,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:37" (2/3) ... [2020-07-29 01:42:38,519 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7376822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:42:38, skipping insertion in model container [2020-07-29 01:42:38,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:38,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:42:38" (3/3) ... [2020-07-29 01:42:38,521 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2020-07-29 01:42:38,573 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:42:38,573 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:42:38,574 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:42:38,574 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:42:38,574 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:42:38,574 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:42:38,574 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:42:38,575 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:42:38,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:42:38,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:42:38,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:38,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:38,624 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:42:38,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:38,624 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:42:38,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:42:38,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:42:38,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:38,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:38,630 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:42:38,630 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:38,639 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 4#L19-3true [2020-07-29 01:42:38,639 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2020-07-29 01:42:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:42:38,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:38,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608164155] [2020-07-29 01:42:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:38,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:38,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:38,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-07-29 01:42:38,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:38,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64591314] [2020-07-29 01:42:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:38,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:38,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:38,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:38,803 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-07-29 01:42:38,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:38,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502819126] [2020-07-29 01:42:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:38,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:38,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:38,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:39,083 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:42:39,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:42:39,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:42:39,085 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:42:39,085 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:42:39,085 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:39,086 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:42:39,086 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:42:39,086 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2020-07-29 01:42:39,086 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:42:39,087 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:42:39,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:39,767 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:42:39,773 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:42:39,789 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-07-29 01:42:39,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:39,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:39,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:39,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:39,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:39,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:39,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:39,800 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:42:39,843 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-07-29 01:42:39,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:39,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:39,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:39,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:39,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:39,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:39,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:39,851 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:42:39,881 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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:39,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:39,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:39,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:39,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:39,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:39,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:39,893 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:42:39,930 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-07-29 01:42:39,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:39,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:39,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:39,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:39,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:39,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:39,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:39,937 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 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:39,985 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-07-29 01:42:39,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:39,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:39,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:39,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:39,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:39,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:39,995 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 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:40,035 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-07-29 01:42:40,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:40,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:40,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:40,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:40,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:40,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:40,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:42:40,089 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:42:40,089 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:42:40,096 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:40,111 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:42:40,111 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:42:40,112 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1) = -2*ULTIMATE.start_main_~i~0 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1 Supporting invariants [] [2020-07-29 01:42:40,239 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:42:40,243 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1;" "main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;" [2020-07-29 01:42:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:40,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:42:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:40,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:42:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:40,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:40,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {23#unseeded} is VALID [2020-07-29 01:42:40,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#unseeded} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {23#unseeded} is VALID [2020-07-29 01:42:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:40,322 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:42:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:40,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:40,396 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) (* 21 (select |#length| |ULTIMATE.start_main_~#in~0.base|))))} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {49#(and (< ULTIMATE.start_main_~i~0 11) (<= 1 (select |#length| |ULTIMATE.start_main_~#in~0.base|)) (<= (* 21 (select |#length| |ULTIMATE.start_main_~#in~0.base|)) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))))} is VALID [2020-07-29 01:42:40,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(and (< ULTIMATE.start_main_~i~0 11) (<= 1 (select |#length| |ULTIMATE.start_main_~#in~0.base|)) (<= (* 21 (select |#length| |ULTIMATE.start_main_~#in~0.base|)) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))))} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {41#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) (* 21 (select |#length| |ULTIMATE.start_main_~#in~0.base|)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:42:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:40,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:42:40,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:40,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:40,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,430 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-07-29 01:42:40,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2020-07-29 01:42:40,510 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2020-07-29 01:42:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:42:40,510 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:40,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:42:40,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:42:40,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:40,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:40,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:42:40,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:42:40,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:40,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:40,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2020-07-29 01:42:40,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:40,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:40,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:40,525 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 01:42:40,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:42:40,532 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:42:40,533 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:42:40,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:42:40,535 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:42:40,537 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 35 transitions. cyclomatic complexity: 13 [2020-07-29 01:42:40,538 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:42:40,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:40,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:40,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:40,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:40,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:40,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:40,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:42:40,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:42:40,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:42:40,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:40,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:40,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:40,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:42:40,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:42:40,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:42:40,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:40,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:40,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:40,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:42:40,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:42:40,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:42:40,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:42:40,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:42:40,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:42:40,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:40,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:40,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:40,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:42:40,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,566 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:42:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-07-29 01:42:40,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:40,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:42:40,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:42:40,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:40,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. cyclomatic complexity: 13 [2020-07-29 01:42:40,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:40,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2020-07-29 01:42:40,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:42:40,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:42:40,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-07-29 01:42:40,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:40,599 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:42:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-07-29 01:42:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:42:40,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:40,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:42:40,627 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:42:40,629 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:42:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:40,634 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2020-07-29 01:42:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:42:40,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:40,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:40,636 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 9 transitions. [2020-07-29 01:42:40,636 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 9 transitions. [2020-07-29 01:42:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:40,637 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2020-07-29 01:42:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:42:40,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:40,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:40,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:40,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:42:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:42:40,640 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:42:40,640 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:42:40,640 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:42:40,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:42:40,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:40,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:40,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:40,642 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:42:40,642 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:40,642 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 89#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 90#L19-3 assume !(main_~i~0 < 11); 91#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 92#L26-2 [2020-07-29 01:42:40,643 INFO L796 eck$LassoCheckResult]: Loop: 92#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 92#L26-2 [2020-07-29 01:42:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-07-29 01:42:40,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:40,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361125824] [2020-07-29 01:42:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:40,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {113#true} is VALID [2020-07-29 01:42:40,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {115#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:40,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {115#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < 11); {114#false} is VALID [2020-07-29 01:42:40,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {114#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {114#false} is VALID [2020-07-29 01:42:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:40,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361125824] [2020-07-29 01:42:40,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:42:40,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:42:40,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990821694] [2020-07-29 01:42:40,712 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2020-07-29 01:42:40,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:40,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875669910] [2020-07-29 01:42:40,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:40,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:40,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:40,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:40,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:40,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:42:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:42:40,930 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:42:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:40,960 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:42:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:42:40,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:42:40,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:40,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-07-29 01:42:40,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:40,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 01:42:40,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:40,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:40,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-07-29 01:42:40,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:40,970 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:42:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-07-29 01:42:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2020-07-29 01:42:40,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:40,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand 7 states. [2020-07-29 01:42:40,971 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand 7 states. [2020-07-29 01:42:40,972 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 7 states. [2020-07-29 01:42:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:40,973 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:42:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:42:40,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:40,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:40,973 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 9 states and 10 transitions. [2020-07-29 01:42:40,973 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 9 states and 10 transitions. [2020-07-29 01:42:40,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:40,974 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:42:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:42:40,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:40,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:40,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:40,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:42:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-07-29 01:42:40,976 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:42:40,976 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:42:40,976 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:42:40,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:42:40,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:40,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:40,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:40,977 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:42:40,977 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:40,978 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 127#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 128#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 132#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 133#L19-3 assume !(main_~i~0 < 11); 129#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 130#L26-2 [2020-07-29 01:42:40,978 INFO L796 eck$LassoCheckResult]: Loop: 130#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 130#L26-2 [2020-07-29 01:42:40,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-07-29 01:42:40,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:40,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418605799] [2020-07-29 01:42:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:41,024 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {155#true} is VALID [2020-07-29 01:42:41,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {157#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:41,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {157#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:41,027 INFO L280 TraceCheckUtils]: 3: Hoare triple {157#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {158#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:41,028 INFO L280 TraceCheckUtils]: 4: Hoare triple {158#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < 11); {156#false} is VALID [2020-07-29 01:42:41,028 INFO L280 TraceCheckUtils]: 5: Hoare triple {156#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {156#false} is VALID [2020-07-29 01:42:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:41,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418605799] [2020-07-29 01:42:41,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740770486] [2020-07-29 01:42:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:41,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:42:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:41,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:41,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {155#true} is VALID [2020-07-29 01:42:41,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {165#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:41,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {165#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {165#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:41,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {165#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {158#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:41,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {158#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < 11); {156#false} is VALID [2020-07-29 01:42:41,141 INFO L280 TraceCheckUtils]: 5: Hoare triple {156#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {156#false} is VALID [2020-07-29 01:42:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:41,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:41,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 01:42:41,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846133722] [2020-07-29 01:42:41,143 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2020-07-29 01:42:41,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:41,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552246390] [2020-07-29 01:42:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:41,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:41,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:41,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:41,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:42:41,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:42:41,291 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2020-07-29 01:42:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:41,358 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:42:41,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:42:41,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:42:41,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:41,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-07-29 01:42:41,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:41,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 01:42:41,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:41,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:41,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-07-29 01:42:41,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:41,376 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:42:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-07-29 01:42:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2020-07-29 01:42:41,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:41,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 12 transitions. Second operand 9 states. [2020-07-29 01:42:41,379 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 12 transitions. Second operand 9 states. [2020-07-29 01:42:41,379 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 9 states. [2020-07-29 01:42:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:41,381 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:42:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:42:41,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:41,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:41,381 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states and 12 transitions. [2020-07-29 01:42:41,381 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states and 12 transitions. [2020-07-29 01:42:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:41,382 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:42:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:42:41,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:41,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:41,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:41,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:42:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 01:42:41,384 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:42:41,384 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:42:41,384 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:42:41,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:42:41,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:41,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:41,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:41,386 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:42:41,386 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:41,386 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 188#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 189#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 193#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 194#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 195#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 196#L19-3 assume !(main_~i~0 < 11); 190#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 191#L26-2 [2020-07-29 01:42:41,386 INFO L796 eck$LassoCheckResult]: Loop: 191#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 191#L26-2 [2020-07-29 01:42:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-07-29 01:42:41,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:41,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951013165] [2020-07-29 01:42:41,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:41,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {222#true} is VALID [2020-07-29 01:42:41,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {222#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {224#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:41,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {224#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:41,496 INFO L280 TraceCheckUtils]: 3: Hoare triple {224#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {225#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:41,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {225#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:41,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {226#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:41,499 INFO L280 TraceCheckUtils]: 6: Hoare triple {226#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < 11); {223#false} is VALID [2020-07-29 01:42:41,500 INFO L280 TraceCheckUtils]: 7: Hoare triple {223#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {223#false} is VALID [2020-07-29 01:42:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:41,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951013165] [2020-07-29 01:42:41,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66603488] [2020-07-29 01:42:41,501 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:41,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:42:41,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:41,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:42:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:41,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:41,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {222#true} is VALID [2020-07-29 01:42:41,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {222#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {233#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:41,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {233#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:41,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {233#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {225#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:41,661 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {225#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:41,662 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {226#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:41,663 INFO L280 TraceCheckUtils]: 6: Hoare triple {226#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < 11); {223#false} is VALID [2020-07-29 01:42:41,664 INFO L280 TraceCheckUtils]: 7: Hoare triple {223#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {223#false} is VALID [2020-07-29 01:42:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:41,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:41,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 01:42:41,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292725109] [2020-07-29 01:42:41,665 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:41,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:41,666 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2020-07-29 01:42:41,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:41,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584516152] [2020-07-29 01:42:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:41,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:41,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:41,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:41,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:42:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:42:41,840 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2020-07-29 01:42:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:41,902 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:42:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:42:41,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:42:41,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:41,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-07-29 01:42:41,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:41,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-07-29 01:42:41,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:41,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:41,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-07-29 01:42:41,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:41,923 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:42:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-07-29 01:42:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-07-29 01:42:41,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:41,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 14 transitions. Second operand 11 states. [2020-07-29 01:42:41,924 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 14 transitions. Second operand 11 states. [2020-07-29 01:42:41,925 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 11 states. [2020-07-29 01:42:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:41,926 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:42:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:42:41,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:41,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:41,927 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 13 states and 14 transitions. [2020-07-29 01:42:41,927 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 13 states and 14 transitions. [2020-07-29 01:42:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:41,928 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:42:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:42:41,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:41,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:41,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:41,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:42:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 01:42:41,930 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:42:41,930 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:42:41,931 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:42:41,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:42:41,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:41,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:41,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:41,932 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-07-29 01:42:41,932 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:41,932 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 266#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 267#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 268#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 274#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 273#L19-3 assume !(main_~i~0 < 11); 264#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 265#L26-2 [2020-07-29 01:42:41,933 INFO L796 eck$LassoCheckResult]: Loop: 265#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 265#L26-2 [2020-07-29 01:42:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-07-29 01:42:41,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:41,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105608798] [2020-07-29 01:42:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:42,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {304#true} is VALID [2020-07-29 01:42:42,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {306#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:42,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {306#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:42,005 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {307#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:42,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {307#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {307#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:42,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {307#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {308#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:42,008 INFO L280 TraceCheckUtils]: 6: Hoare triple {308#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {308#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:42,009 INFO L280 TraceCheckUtils]: 7: Hoare triple {308#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {309#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:42,010 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#(<= ULTIMATE.start_main_~i~0 3)} assume !(main_~i~0 < 11); {305#false} is VALID [2020-07-29 01:42:42,010 INFO L280 TraceCheckUtils]: 9: Hoare triple {305#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {305#false} is VALID [2020-07-29 01:42:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:42,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105608798] [2020-07-29 01:42:42,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003412890] [2020-07-29 01:42:42,011 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:42,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-29 01:42:42,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:42,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:42:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:42,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:42,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {304#true} is VALID [2020-07-29 01:42:42,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {316#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:42,194 INFO L280 TraceCheckUtils]: 2: Hoare triple {316#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {316#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:42,195 INFO L280 TraceCheckUtils]: 3: Hoare triple {316#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {307#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:42,196 INFO L280 TraceCheckUtils]: 4: Hoare triple {307#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {307#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:42,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {307#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {308#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:42,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {308#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {308#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:42,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {308#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {309#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:42,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#(<= ULTIMATE.start_main_~i~0 3)} assume !(main_~i~0 < 11); {305#false} is VALID [2020-07-29 01:42:42,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {305#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {305#false} is VALID [2020-07-29 01:42:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:42,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:42,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:42:42,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091167163] [2020-07-29 01:42:42,204 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:42,204 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2020-07-29 01:42:42,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:42,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682903020] [2020-07-29 01:42:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:42,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:42,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:42,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:42,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:42,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:42:42,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:42:42,318 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-07-29 01:42:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:42,389 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-29 01:42:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:42:42,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:42:42,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:42,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2020-07-29 01:42:42,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:42,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2020-07-29 01:42:42,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:42,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:42,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2020-07-29 01:42:42,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:42,414 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-29 01:42:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2020-07-29 01:42:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-07-29 01:42:42,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:42,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 16 transitions. Second operand 13 states. [2020-07-29 01:42:42,417 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 16 transitions. Second operand 13 states. [2020-07-29 01:42:42,417 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2020-07-29 01:42:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:42,423 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-29 01:42:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-29 01:42:42,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:42,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:42,424 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 15 states and 16 transitions. [2020-07-29 01:42:42,424 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 15 states and 16 transitions. [2020-07-29 01:42:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:42,427 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-29 01:42:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-29 01:42:42,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:42,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:42,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:42,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:42:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-29 01:42:42,431 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:42:42,431 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:42:42,431 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:42:42,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:42:42,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:42,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:42,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:42,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-07-29 01:42:42,434 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:42,434 INFO L794 eck$LassoCheckResult]: Stem: 359#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 355#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 356#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 360#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 361#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 362#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 367#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 366#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 365#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 364#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 363#L19-3 assume !(main_~i~0 < 11); 357#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 358#L26-2 [2020-07-29 01:42:42,434 INFO L796 eck$LassoCheckResult]: Loop: 358#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 358#L26-2 [2020-07-29 01:42:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-07-29 01:42:42,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:42,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579295930] [2020-07-29 01:42:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:42,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {401#true} is VALID [2020-07-29 01:42:42,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {401#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {403#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:42,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {403#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:42,556 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {404#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:42,557 INFO L280 TraceCheckUtils]: 4: Hoare triple {404#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {404#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:42,560 INFO L280 TraceCheckUtils]: 5: Hoare triple {404#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {405#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:42,561 INFO L280 TraceCheckUtils]: 6: Hoare triple {405#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {405#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:42,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {405#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {406#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:42,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {406#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:42,564 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {407#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:42,565 INFO L280 TraceCheckUtils]: 10: Hoare triple {407#(<= ULTIMATE.start_main_~i~0 4)} assume !(main_~i~0 < 11); {402#false} is VALID [2020-07-29 01:42:42,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {402#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {402#false} is VALID [2020-07-29 01:42:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:42,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579295930] [2020-07-29 01:42:42,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726633419] [2020-07-29 01:42:42,567 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:42,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:42:42,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:42,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:42:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:42,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:42,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {401#true} is VALID [2020-07-29 01:42:42,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {401#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {414#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:42,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {414#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {414#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:42,778 INFO L280 TraceCheckUtils]: 3: Hoare triple {414#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {404#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:42,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {404#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {404#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:42,781 INFO L280 TraceCheckUtils]: 5: Hoare triple {404#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {405#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:42,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {405#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {405#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:42,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {405#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {406#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:42,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {406#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:42,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {407#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:42,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {407#(<= ULTIMATE.start_main_~i~0 4)} assume !(main_~i~0 < 11); {402#false} is VALID [2020-07-29 01:42:42,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {402#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {402#false} is VALID [2020-07-29 01:42:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:42,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:42,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 01:42:42,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091760797] [2020-07-29 01:42:42,787 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2020-07-29 01:42:42,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:42,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202087001] [2020-07-29 01:42:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:42,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:42,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:42,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:42,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:42:42,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:42:42,896 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2020-07-29 01:42:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:42,983 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-29 01:42:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:42:42,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:42:43,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:43,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2020-07-29 01:42:43,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:43,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2020-07-29 01:42:43,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:43,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:43,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2020-07-29 01:42:43,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:43,011 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-29 01:42:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2020-07-29 01:42:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-07-29 01:42:43,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:43,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 18 transitions. Second operand 15 states. [2020-07-29 01:42:43,014 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 18 transitions. Second operand 15 states. [2020-07-29 01:42:43,014 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 15 states. [2020-07-29 01:42:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:43,015 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-29 01:42:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-29 01:42:43,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:43,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:43,015 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 17 states and 18 transitions. [2020-07-29 01:42:43,015 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 17 states and 18 transitions. [2020-07-29 01:42:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:43,018 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-29 01:42:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-29 01:42:43,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:43,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:43,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:43,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:42:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-29 01:42:43,028 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-29 01:42:43,028 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-29 01:42:43,028 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:42:43,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-07-29 01:42:43,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:43,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:43,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:43,030 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-07-29 01:42:43,031 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:43,031 INFO L794 eck$LassoCheckResult]: Stem: 468#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 463#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 464#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 465#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 466#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 467#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 469#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 475#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 474#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 473#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 472#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 471#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 470#L19-3 assume !(main_~i~0 < 11); 461#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 462#L26-2 [2020-07-29 01:42:43,031 INFO L796 eck$LassoCheckResult]: Loop: 462#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 462#L26-2 [2020-07-29 01:42:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-07-29 01:42:43,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:43,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379395843] [2020-07-29 01:42:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:43,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {513#true} is VALID [2020-07-29 01:42:43,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {515#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:43,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {515#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {515#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:43,144 INFO L280 TraceCheckUtils]: 3: Hoare triple {515#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {516#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:43,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {516#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {516#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:43,146 INFO L280 TraceCheckUtils]: 5: Hoare triple {516#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {517#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:43,147 INFO L280 TraceCheckUtils]: 6: Hoare triple {517#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {517#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:43,148 INFO L280 TraceCheckUtils]: 7: Hoare triple {517#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {518#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:43,149 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {518#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:43,150 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {519#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:43,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {519#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {519#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:43,152 INFO L280 TraceCheckUtils]: 11: Hoare triple {519#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {520#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:43,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {520#(<= ULTIMATE.start_main_~i~0 5)} assume !(main_~i~0 < 11); {514#false} is VALID [2020-07-29 01:42:43,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {514#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {514#false} is VALID [2020-07-29 01:42:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:43,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379395843] [2020-07-29 01:42:43,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171452607] [2020-07-29 01:42:43,156 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:43,210 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-29 01:42:43,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:43,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:42:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:43,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:43,396 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {513#true} is VALID [2020-07-29 01:42:43,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {527#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:43,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {527#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {527#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:43,399 INFO L280 TraceCheckUtils]: 3: Hoare triple {527#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {516#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:43,400 INFO L280 TraceCheckUtils]: 4: Hoare triple {516#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {516#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:43,401 INFO L280 TraceCheckUtils]: 5: Hoare triple {516#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {517#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:43,401 INFO L280 TraceCheckUtils]: 6: Hoare triple {517#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {517#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:43,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {517#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {518#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:43,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {518#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:43,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {519#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:43,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {519#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {519#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:43,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {519#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {520#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:43,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {520#(<= ULTIMATE.start_main_~i~0 5)} assume !(main_~i~0 < 11); {514#false} is VALID [2020-07-29 01:42:43,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {514#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {514#false} is VALID [2020-07-29 01:42:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:43,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:43,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-29 01:42:43,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374258658] [2020-07-29 01:42:43,411 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:43,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:43,412 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2020-07-29 01:42:43,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:43,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26658701] [2020-07-29 01:42:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:43,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:43,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:43,450 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:43,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:43,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:42:43,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:42:43,551 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2020-07-29 01:42:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:43,643 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-29 01:42:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:42:43,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:42:43,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:43,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2020-07-29 01:42:43,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:43,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2020-07-29 01:42:43,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:43,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:43,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2020-07-29 01:42:43,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:43,669 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-29 01:42:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2020-07-29 01:42:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-07-29 01:42:43,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:43,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 20 transitions. Second operand 17 states. [2020-07-29 01:42:43,670 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 20 transitions. Second operand 17 states. [2020-07-29 01:42:43,670 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 17 states. [2020-07-29 01:42:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:43,671 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-29 01:42:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-29 01:42:43,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:43,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:43,672 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states and 20 transitions. [2020-07-29 01:42:43,672 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states and 20 transitions. [2020-07-29 01:42:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:43,673 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-29 01:42:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-29 01:42:43,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:43,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:43,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:43,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:42:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-07-29 01:42:43,675 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-29 01:42:43,675 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-29 01:42:43,675 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:42:43,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2020-07-29 01:42:43,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:43,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:43,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:43,676 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-07-29 01:42:43,676 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:43,677 INFO L794 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 584#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 585#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 586#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 587#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 588#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 590#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 598#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 597#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 596#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 595#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 594#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 593#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 592#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 591#L19-3 assume !(main_~i~0 < 11); 582#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 583#L26-2 [2020-07-29 01:42:43,677 INFO L796 eck$LassoCheckResult]: Loop: 583#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 583#L26-2 [2020-07-29 01:42:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:43,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-07-29 01:42:43,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:43,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660433097] [2020-07-29 01:42:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:43,792 INFO L280 TraceCheckUtils]: 0: Hoare triple {640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {640#true} is VALID [2020-07-29 01:42:43,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {640#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {642#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:43,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {642#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {642#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:43,794 INFO L280 TraceCheckUtils]: 3: Hoare triple {642#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {643#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:43,795 INFO L280 TraceCheckUtils]: 4: Hoare triple {643#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {643#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:43,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {643#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {644#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:43,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {644#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {644#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:43,797 INFO L280 TraceCheckUtils]: 7: Hoare triple {644#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {645#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:43,798 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {645#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:43,799 INFO L280 TraceCheckUtils]: 9: Hoare triple {645#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {646#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:43,800 INFO L280 TraceCheckUtils]: 10: Hoare triple {646#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {646#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:43,800 INFO L280 TraceCheckUtils]: 11: Hoare triple {646#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {647#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:43,801 INFO L280 TraceCheckUtils]: 12: Hoare triple {647#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {647#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:43,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {647#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {648#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:43,803 INFO L280 TraceCheckUtils]: 14: Hoare triple {648#(<= ULTIMATE.start_main_~i~0 6)} assume !(main_~i~0 < 11); {641#false} is VALID [2020-07-29 01:42:43,803 INFO L280 TraceCheckUtils]: 15: Hoare triple {641#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {641#false} is VALID [2020-07-29 01:42:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:43,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660433097] [2020-07-29 01:42:43,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313389338] [2020-07-29 01:42:43,804 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:43,856 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-29 01:42:43,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:43,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:42:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:43,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:44,059 INFO L280 TraceCheckUtils]: 0: Hoare triple {640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {640#true} is VALID [2020-07-29 01:42:44,060 INFO L280 TraceCheckUtils]: 1: Hoare triple {640#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {655#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:44,060 INFO L280 TraceCheckUtils]: 2: Hoare triple {655#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {655#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:44,061 INFO L280 TraceCheckUtils]: 3: Hoare triple {655#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {643#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:44,062 INFO L280 TraceCheckUtils]: 4: Hoare triple {643#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {643#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:44,063 INFO L280 TraceCheckUtils]: 5: Hoare triple {643#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {644#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:44,064 INFO L280 TraceCheckUtils]: 6: Hoare triple {644#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {644#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:44,064 INFO L280 TraceCheckUtils]: 7: Hoare triple {644#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {645#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:44,065 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {645#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:44,066 INFO L280 TraceCheckUtils]: 9: Hoare triple {645#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {646#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:44,066 INFO L280 TraceCheckUtils]: 10: Hoare triple {646#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {646#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:44,067 INFO L280 TraceCheckUtils]: 11: Hoare triple {646#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {647#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:44,068 INFO L280 TraceCheckUtils]: 12: Hoare triple {647#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {647#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:44,069 INFO L280 TraceCheckUtils]: 13: Hoare triple {647#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {648#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:44,070 INFO L280 TraceCheckUtils]: 14: Hoare triple {648#(<= ULTIMATE.start_main_~i~0 6)} assume !(main_~i~0 < 11); {641#false} is VALID [2020-07-29 01:42:44,070 INFO L280 TraceCheckUtils]: 15: Hoare triple {641#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {641#false} is VALID [2020-07-29 01:42:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:44,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:44,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-29 01:42:44,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259354237] [2020-07-29 01:42:44,072 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2020-07-29 01:42:44,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:44,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548112702] [2020-07-29 01:42:44,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:44,081 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:44,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:44,090 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:44,257 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-29 01:42:44,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:42:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:42:44,258 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2020-07-29 01:42:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:44,386 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-29 01:42:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:42:44,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:42:44,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:44,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2020-07-29 01:42:44,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:44,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2020-07-29 01:42:44,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:44,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:44,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2020-07-29 01:42:44,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:44,436 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-29 01:42:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2020-07-29 01:42:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-29 01:42:44,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:44,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 22 transitions. Second operand 19 states. [2020-07-29 01:42:44,438 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 22 transitions. Second operand 19 states. [2020-07-29 01:42:44,438 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 19 states. [2020-07-29 01:42:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:44,444 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-29 01:42:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-29 01:42:44,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:44,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:44,445 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states and 22 transitions. [2020-07-29 01:42:44,445 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states and 22 transitions. [2020-07-29 01:42:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:44,451 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-29 01:42:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-29 01:42:44,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:44,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:44,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:44,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:42:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-29 01:42:44,454 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-29 01:42:44,454 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-29 01:42:44,454 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:42:44,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2020-07-29 01:42:44,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:44,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:44,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:44,459 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-07-29 01:42:44,459 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:44,459 INFO L794 eck$LassoCheckResult]: Stem: 725#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 720#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 721#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 722#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 723#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 724#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 726#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 736#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 735#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 734#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 733#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 732#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 731#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 730#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 729#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 728#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 727#L19-3 assume !(main_~i~0 < 11); 718#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 719#L26-2 [2020-07-29 01:42:44,459 INFO L796 eck$LassoCheckResult]: Loop: 719#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 719#L26-2 [2020-07-29 01:42:44,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:44,459 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-07-29 01:42:44,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:44,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220438556] [2020-07-29 01:42:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:44,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {782#true} is VALID [2020-07-29 01:42:44,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {782#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {784#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:44,610 INFO L280 TraceCheckUtils]: 2: Hoare triple {784#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {784#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:44,610 INFO L280 TraceCheckUtils]: 3: Hoare triple {784#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {785#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:44,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {785#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {785#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:44,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {785#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {786#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:44,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {786#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {786#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:44,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {786#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {787#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:44,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {787#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {787#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:44,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {787#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {788#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:44,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {788#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {788#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:44,617 INFO L280 TraceCheckUtils]: 11: Hoare triple {788#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {789#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:44,618 INFO L280 TraceCheckUtils]: 12: Hoare triple {789#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {789#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:44,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {789#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {790#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:44,622 INFO L280 TraceCheckUtils]: 14: Hoare triple {790#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {790#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:44,623 INFO L280 TraceCheckUtils]: 15: Hoare triple {790#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {791#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:44,624 INFO L280 TraceCheckUtils]: 16: Hoare triple {791#(<= ULTIMATE.start_main_~i~0 7)} assume !(main_~i~0 < 11); {783#false} is VALID [2020-07-29 01:42:44,624 INFO L280 TraceCheckUtils]: 17: Hoare triple {783#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {783#false} is VALID [2020-07-29 01:42:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:44,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220438556] [2020-07-29 01:42:44,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105232785] [2020-07-29 01:42:44,627 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:44,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:42:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:44,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:44,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {782#true} is VALID [2020-07-29 01:42:44,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {782#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {798#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:44,875 INFO L280 TraceCheckUtils]: 2: Hoare triple {798#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {798#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:44,876 INFO L280 TraceCheckUtils]: 3: Hoare triple {798#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {785#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:44,876 INFO L280 TraceCheckUtils]: 4: Hoare triple {785#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {785#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:44,877 INFO L280 TraceCheckUtils]: 5: Hoare triple {785#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {786#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:44,878 INFO L280 TraceCheckUtils]: 6: Hoare triple {786#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {786#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:44,878 INFO L280 TraceCheckUtils]: 7: Hoare triple {786#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {787#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:44,879 INFO L280 TraceCheckUtils]: 8: Hoare triple {787#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {787#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:44,879 INFO L280 TraceCheckUtils]: 9: Hoare triple {787#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {788#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:44,880 INFO L280 TraceCheckUtils]: 10: Hoare triple {788#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {788#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:44,881 INFO L280 TraceCheckUtils]: 11: Hoare triple {788#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {789#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:44,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {789#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {789#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:44,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {789#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {790#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:44,882 INFO L280 TraceCheckUtils]: 14: Hoare triple {790#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {790#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:44,883 INFO L280 TraceCheckUtils]: 15: Hoare triple {790#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {791#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:44,884 INFO L280 TraceCheckUtils]: 16: Hoare triple {791#(<= ULTIMATE.start_main_~i~0 7)} assume !(main_~i~0 < 11); {783#false} is VALID [2020-07-29 01:42:44,884 INFO L280 TraceCheckUtils]: 17: Hoare triple {783#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {783#false} is VALID [2020-07-29 01:42:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:44,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:44,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-07-29 01:42:44,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366594508] [2020-07-29 01:42:44,888 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2020-07-29 01:42:44,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:44,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105122054] [2020-07-29 01:42:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:44,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:44,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:44,907 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:44,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:42:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:42:45,000 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2020-07-29 01:42:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:45,135 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-29 01:42:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:42:45,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:42:45,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:45,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2020-07-29 01:42:45,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:45,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2020-07-29 01:42:45,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:45,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:45,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2020-07-29 01:42:45,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:45,162 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-29 01:42:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2020-07-29 01:42:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-29 01:42:45,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:45,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 24 transitions. Second operand 21 states. [2020-07-29 01:42:45,165 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 24 transitions. Second operand 21 states. [2020-07-29 01:42:45,165 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 21 states. [2020-07-29 01:42:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:45,166 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-29 01:42:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-29 01:42:45,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:45,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:45,167 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states and 24 transitions. [2020-07-29 01:42:45,167 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states and 24 transitions. [2020-07-29 01:42:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:45,171 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-29 01:42:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-29 01:42:45,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:45,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:45,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:45,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:42:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-29 01:42:45,173 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-29 01:42:45,173 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-29 01:42:45,173 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:42:45,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2020-07-29 01:42:45,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:45,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:45,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:45,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-07-29 01:42:45,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:45,175 INFO L794 eck$LassoCheckResult]: Stem: 876#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 871#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 872#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 873#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 874#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 877#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 869#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 870#L26-2 [2020-07-29 01:42:45,176 INFO L796 eck$LassoCheckResult]: Loop: 870#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 870#L26-2 [2020-07-29 01:42:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:45,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-07-29 01:42:45,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:45,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366014572] [2020-07-29 01:42:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:45,304 INFO L280 TraceCheckUtils]: 0: Hoare triple {939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {939#true} is VALID [2020-07-29 01:42:45,305 INFO L280 TraceCheckUtils]: 1: Hoare triple {939#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {941#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:45,305 INFO L280 TraceCheckUtils]: 2: Hoare triple {941#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {941#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:45,306 INFO L280 TraceCheckUtils]: 3: Hoare triple {941#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {942#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:45,306 INFO L280 TraceCheckUtils]: 4: Hoare triple {942#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {942#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:45,307 INFO L280 TraceCheckUtils]: 5: Hoare triple {942#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {943#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:45,307 INFO L280 TraceCheckUtils]: 6: Hoare triple {943#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {943#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:45,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {943#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {944#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:45,309 INFO L280 TraceCheckUtils]: 8: Hoare triple {944#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {944#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:45,309 INFO L280 TraceCheckUtils]: 9: Hoare triple {944#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {945#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:45,310 INFO L280 TraceCheckUtils]: 10: Hoare triple {945#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {945#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:45,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {945#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {946#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:45,311 INFO L280 TraceCheckUtils]: 12: Hoare triple {946#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {946#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:45,312 INFO L280 TraceCheckUtils]: 13: Hoare triple {946#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {947#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:45,312 INFO L280 TraceCheckUtils]: 14: Hoare triple {947#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {947#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:45,319 INFO L280 TraceCheckUtils]: 15: Hoare triple {947#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {948#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:45,322 INFO L280 TraceCheckUtils]: 16: Hoare triple {948#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {948#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:45,323 INFO L280 TraceCheckUtils]: 17: Hoare triple {948#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {949#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:45,323 INFO L280 TraceCheckUtils]: 18: Hoare triple {949#(<= ULTIMATE.start_main_~i~0 8)} assume !(main_~i~0 < 11); {940#false} is VALID [2020-07-29 01:42:45,324 INFO L280 TraceCheckUtils]: 19: Hoare triple {940#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {940#false} is VALID [2020-07-29 01:42:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:45,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366014572] [2020-07-29 01:42:45,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269438965] [2020-07-29 01:42:45,325 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:45,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:42:45,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:45,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:42:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:45,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:45,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {939#true} is VALID [2020-07-29 01:42:45,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {939#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {956#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:45,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {956#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {956#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:45,632 INFO L280 TraceCheckUtils]: 3: Hoare triple {956#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {942#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:45,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {942#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {942#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:45,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {942#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {943#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:45,634 INFO L280 TraceCheckUtils]: 6: Hoare triple {943#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {943#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:45,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {943#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {944#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:45,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {944#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {944#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:45,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {944#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {945#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:45,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {945#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {945#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:45,643 INFO L280 TraceCheckUtils]: 11: Hoare triple {945#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {946#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:45,643 INFO L280 TraceCheckUtils]: 12: Hoare triple {946#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {946#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:45,644 INFO L280 TraceCheckUtils]: 13: Hoare triple {946#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {947#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:45,644 INFO L280 TraceCheckUtils]: 14: Hoare triple {947#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {947#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:45,645 INFO L280 TraceCheckUtils]: 15: Hoare triple {947#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {948#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:45,646 INFO L280 TraceCheckUtils]: 16: Hoare triple {948#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {948#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:45,646 INFO L280 TraceCheckUtils]: 17: Hoare triple {948#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {949#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:45,647 INFO L280 TraceCheckUtils]: 18: Hoare triple {949#(<= ULTIMATE.start_main_~i~0 8)} assume !(main_~i~0 < 11); {940#false} is VALID [2020-07-29 01:42:45,647 INFO L280 TraceCheckUtils]: 19: Hoare triple {940#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {940#false} is VALID [2020-07-29 01:42:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:45,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:45,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-07-29 01:42:45,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303078866] [2020-07-29 01:42:45,649 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2020-07-29 01:42:45,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:45,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820404806] [2020-07-29 01:42:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:45,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:45,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:45,665 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:45,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:42:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:42:45,750 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2020-07-29 01:42:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:45,876 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:42:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:42:45,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:42:45,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:45,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2020-07-29 01:42:45,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:45,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2020-07-29 01:42:45,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:42:45,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:42:45,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2020-07-29 01:42:45,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:45,922 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-29 01:42:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2020-07-29 01:42:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-29 01:42:45,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:45,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 26 transitions. Second operand 23 states. [2020-07-29 01:42:45,924 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 26 transitions. Second operand 23 states. [2020-07-29 01:42:45,924 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 23 states. [2020-07-29 01:42:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:45,925 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:42:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:42:45,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:45,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:45,926 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states and 26 transitions. [2020-07-29 01:42:45,926 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states and 26 transitions. [2020-07-29 01:42:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:45,927 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:42:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:42:45,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:45,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:45,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:45,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:42:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-29 01:42:45,929 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-29 01:42:45,929 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-29 01:42:45,929 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:42:45,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2020-07-29 01:42:45,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:45,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:45,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:45,931 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-07-29 01:42:45,931 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:45,931 INFO L794 eck$LassoCheckResult]: Stem: 1042#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1037#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1038#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1039#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1040#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1041#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1043#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1057#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1056#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1055#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1054#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1053#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1052#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1051#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1050#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1049#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1048#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1047#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1046#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1045#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1044#L19-3 assume !(main_~i~0 < 11); 1035#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1036#L26-2 [2020-07-29 01:42:45,932 INFO L796 eck$LassoCheckResult]: Loop: 1036#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1036#L26-2 [2020-07-29 01:42:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-07-29 01:42:45,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:45,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618488411] [2020-07-29 01:42:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:46,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {1111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1111#true} is VALID [2020-07-29 01:42:46,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {1111#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {1113#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:46,078 INFO L280 TraceCheckUtils]: 2: Hoare triple {1113#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1113#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:46,079 INFO L280 TraceCheckUtils]: 3: Hoare triple {1113#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1114#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:46,079 INFO L280 TraceCheckUtils]: 4: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1114#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:46,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1115#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:46,081 INFO L280 TraceCheckUtils]: 6: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1115#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:46,081 INFO L280 TraceCheckUtils]: 7: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1116#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:46,082 INFO L280 TraceCheckUtils]: 8: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1116#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:46,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1117#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:46,083 INFO L280 TraceCheckUtils]: 10: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1117#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:46,084 INFO L280 TraceCheckUtils]: 11: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1118#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:46,084 INFO L280 TraceCheckUtils]: 12: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1118#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:46,085 INFO L280 TraceCheckUtils]: 13: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1119#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:46,085 INFO L280 TraceCheckUtils]: 14: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1119#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:46,086 INFO L280 TraceCheckUtils]: 15: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1120#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:46,087 INFO L280 TraceCheckUtils]: 16: Hoare triple {1120#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1120#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:46,087 INFO L280 TraceCheckUtils]: 17: Hoare triple {1120#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1121#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:46,088 INFO L280 TraceCheckUtils]: 18: Hoare triple {1121#(<= ULTIMATE.start_main_~i~0 8)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1121#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:46,088 INFO L280 TraceCheckUtils]: 19: Hoare triple {1121#(<= ULTIMATE.start_main_~i~0 8)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1122#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-29 01:42:46,089 INFO L280 TraceCheckUtils]: 20: Hoare triple {1122#(<= ULTIMATE.start_main_~i~0 9)} assume !(main_~i~0 < 11); {1112#false} is VALID [2020-07-29 01:42:46,089 INFO L280 TraceCheckUtils]: 21: Hoare triple {1112#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {1112#false} is VALID [2020-07-29 01:42:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:46,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618488411] [2020-07-29 01:42:46,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931648217] [2020-07-29 01:42:46,092 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:46,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-07-29 01:42:46,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:46,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:42:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:46,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:46,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {1111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1111#true} is VALID [2020-07-29 01:42:46,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {1111#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {1129#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:46,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {1129#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1129#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:46,486 INFO L280 TraceCheckUtils]: 3: Hoare triple {1129#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1114#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:46,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1114#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:46,487 INFO L280 TraceCheckUtils]: 5: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1115#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:46,488 INFO L280 TraceCheckUtils]: 6: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1115#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:46,488 INFO L280 TraceCheckUtils]: 7: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1116#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:46,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1116#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:46,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1117#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:46,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1117#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:46,490 INFO L280 TraceCheckUtils]: 11: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1118#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:46,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1118#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:46,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1119#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:46,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1119#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:46,495 INFO L280 TraceCheckUtils]: 15: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1120#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:46,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {1120#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1120#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:46,502 INFO L280 TraceCheckUtils]: 17: Hoare triple {1120#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1121#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:46,503 INFO L280 TraceCheckUtils]: 18: Hoare triple {1121#(<= ULTIMATE.start_main_~i~0 8)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1121#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:46,504 INFO L280 TraceCheckUtils]: 19: Hoare triple {1121#(<= ULTIMATE.start_main_~i~0 8)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1122#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-29 01:42:46,504 INFO L280 TraceCheckUtils]: 20: Hoare triple {1122#(<= ULTIMATE.start_main_~i~0 9)} assume !(main_~i~0 < 11); {1112#false} is VALID [2020-07-29 01:42:46,504 INFO L280 TraceCheckUtils]: 21: Hoare triple {1112#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {1112#false} is VALID [2020-07-29 01:42:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:46,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:46,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-07-29 01:42:46,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336647253] [2020-07-29 01:42:46,506 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2020-07-29 01:42:46,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:46,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495463336] [2020-07-29 01:42:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:46,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:46,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:46,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:46,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:46,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:42:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:42:46,605 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2020-07-29 01:42:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:46,712 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-29 01:42:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 01:42:46,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:42:46,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:46,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2020-07-29 01:42:46,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:46,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2020-07-29 01:42:46,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:42:46,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:42:46,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2020-07-29 01:42:46,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:46,751 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-29 01:42:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2020-07-29 01:42:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2020-07-29 01:42:46,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:46,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 29 transitions. Second operand 25 states. [2020-07-29 01:42:46,753 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 29 transitions. Second operand 25 states. [2020-07-29 01:42:46,753 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 25 states. [2020-07-29 01:42:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:46,754 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-29 01:42:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-29 01:42:46,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:46,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:46,755 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 28 states and 29 transitions. [2020-07-29 01:42:46,755 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 28 states and 29 transitions. [2020-07-29 01:42:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:46,755 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-29 01:42:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-29 01:42:46,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:46,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:46,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:46,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:42:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-29 01:42:46,757 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-29 01:42:46,757 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-29 01:42:46,757 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 01:42:46,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:42:46,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:46,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:46,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:46,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-07-29 01:42:46,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:46,762 INFO L794 eck$LassoCheckResult]: Stem: 1221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1217#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1218#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1222#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1223#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1224#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1241#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1240#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1239#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1238#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1237#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1236#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1235#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1234#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1233#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1232#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1231#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1230#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1229#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1228#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1227#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1226#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1225#L19-3 assume !(main_~i~0 < 11); 1219#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1220#L26-2 [2020-07-29 01:42:46,762 INFO L796 eck$LassoCheckResult]: Loop: 1220#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1220#L26-2 [2020-07-29 01:42:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-07-29 01:42:46,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:46,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308937055] [2020-07-29 01:42:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:46,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {1301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1301#true} is VALID [2020-07-29 01:42:46,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {1301#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {1303#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:46,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {1303#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1303#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:46,963 INFO L280 TraceCheckUtils]: 3: Hoare triple {1303#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1304#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:46,963 INFO L280 TraceCheckUtils]: 4: Hoare triple {1304#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1304#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:46,964 INFO L280 TraceCheckUtils]: 5: Hoare triple {1304#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1305#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:46,964 INFO L280 TraceCheckUtils]: 6: Hoare triple {1305#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1305#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:46,965 INFO L280 TraceCheckUtils]: 7: Hoare triple {1305#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1306#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:46,965 INFO L280 TraceCheckUtils]: 8: Hoare triple {1306#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1306#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:46,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {1306#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1307#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:46,966 INFO L280 TraceCheckUtils]: 10: Hoare triple {1307#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1307#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:46,967 INFO L280 TraceCheckUtils]: 11: Hoare triple {1307#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1308#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:46,967 INFO L280 TraceCheckUtils]: 12: Hoare triple {1308#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1308#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:46,968 INFO L280 TraceCheckUtils]: 13: Hoare triple {1308#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1309#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:46,968 INFO L280 TraceCheckUtils]: 14: Hoare triple {1309#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1309#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:46,969 INFO L280 TraceCheckUtils]: 15: Hoare triple {1309#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1310#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:46,970 INFO L280 TraceCheckUtils]: 16: Hoare triple {1310#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1310#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:46,970 INFO L280 TraceCheckUtils]: 17: Hoare triple {1310#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1311#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:46,971 INFO L280 TraceCheckUtils]: 18: Hoare triple {1311#(<= ULTIMATE.start_main_~i~0 8)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1311#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:46,971 INFO L280 TraceCheckUtils]: 19: Hoare triple {1311#(<= ULTIMATE.start_main_~i~0 8)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1312#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-29 01:42:46,972 INFO L280 TraceCheckUtils]: 20: Hoare triple {1312#(<= ULTIMATE.start_main_~i~0 9)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1312#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-29 01:42:46,973 INFO L280 TraceCheckUtils]: 21: Hoare triple {1312#(<= ULTIMATE.start_main_~i~0 9)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1313#(<= ULTIMATE.start_main_~i~0 10)} is VALID [2020-07-29 01:42:46,973 INFO L280 TraceCheckUtils]: 22: Hoare triple {1313#(<= ULTIMATE.start_main_~i~0 10)} assume !(main_~i~0 < 11); {1302#false} is VALID [2020-07-29 01:42:46,974 INFO L280 TraceCheckUtils]: 23: Hoare triple {1302#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {1302#false} is VALID [2020-07-29 01:42:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:46,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308937055] [2020-07-29 01:42:46,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473426867] [2020-07-29 01:42:46,975 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:47,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:42:47,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:47,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:42:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:47,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:47,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {1301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1301#true} is VALID [2020-07-29 01:42:47,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {1301#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; {1320#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:47,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {1320#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1320#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:42:47,314 INFO L280 TraceCheckUtils]: 3: Hoare triple {1320#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1304#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:47,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {1304#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1304#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:42:47,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {1304#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1305#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:47,317 INFO L280 TraceCheckUtils]: 6: Hoare triple {1305#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1305#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:42:47,318 INFO L280 TraceCheckUtils]: 7: Hoare triple {1305#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1306#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:47,318 INFO L280 TraceCheckUtils]: 8: Hoare triple {1306#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1306#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:42:47,319 INFO L280 TraceCheckUtils]: 9: Hoare triple {1306#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1307#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:47,320 INFO L280 TraceCheckUtils]: 10: Hoare triple {1307#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1307#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:42:47,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {1307#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1308#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:47,321 INFO L280 TraceCheckUtils]: 12: Hoare triple {1308#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1308#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-29 01:42:47,322 INFO L280 TraceCheckUtils]: 13: Hoare triple {1308#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1309#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:47,323 INFO L280 TraceCheckUtils]: 14: Hoare triple {1309#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1309#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-29 01:42:47,326 INFO L280 TraceCheckUtils]: 15: Hoare triple {1309#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1310#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:47,327 INFO L280 TraceCheckUtils]: 16: Hoare triple {1310#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1310#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-29 01:42:47,327 INFO L280 TraceCheckUtils]: 17: Hoare triple {1310#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1311#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:47,328 INFO L280 TraceCheckUtils]: 18: Hoare triple {1311#(<= ULTIMATE.start_main_~i~0 8)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1311#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-29 01:42:47,329 INFO L280 TraceCheckUtils]: 19: Hoare triple {1311#(<= ULTIMATE.start_main_~i~0 8)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1312#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-29 01:42:47,329 INFO L280 TraceCheckUtils]: 20: Hoare triple {1312#(<= ULTIMATE.start_main_~i~0 9)} assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {1312#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-29 01:42:47,330 INFO L280 TraceCheckUtils]: 21: Hoare triple {1312#(<= ULTIMATE.start_main_~i~0 9)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {1313#(<= ULTIMATE.start_main_~i~0 10)} is VALID [2020-07-29 01:42:47,331 INFO L280 TraceCheckUtils]: 22: Hoare triple {1313#(<= ULTIMATE.start_main_~i~0 10)} assume !(main_~i~0 < 11); {1302#false} is VALID [2020-07-29 01:42:47,331 INFO L280 TraceCheckUtils]: 23: Hoare triple {1302#false} call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; {1302#false} is VALID [2020-07-29 01:42:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:47,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:47,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2020-07-29 01:42:47,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596071052] [2020-07-29 01:42:47,333 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2020-07-29 01:42:47,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:47,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54719075] [2020-07-29 01:42:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:47,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:47,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:47,349 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:47,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:42:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:42:47,459 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2020-07-29 01:42:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:47,626 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:42:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:42:47,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:42:47,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:47,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2020-07-29 01:42:47,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:47,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2020-07-29 01:42:47,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:42:47,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:42:47,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2020-07-29 01:42:47,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:47,669 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-29 01:42:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2020-07-29 01:42:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-29 01:42:47,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:47,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 30 transitions. Second operand 27 states. [2020-07-29 01:42:47,671 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 30 transitions. Second operand 27 states. [2020-07-29 01:42:47,671 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 27 states. [2020-07-29 01:42:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:47,672 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:42:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-29 01:42:47,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:47,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:47,673 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states and 30 transitions. [2020-07-29 01:42:47,673 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states and 30 transitions. [2020-07-29 01:42:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:47,674 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:42:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-29 01:42:47,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:47,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:47,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:47,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:42:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-29 01:42:47,676 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-29 01:42:47,676 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-29 01:42:47,676 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 01:42:47,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2020-07-29 01:42:47,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:42:47,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:47,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:47,678 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2020-07-29 01:42:47,678 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:42:47,678 INFO L794 eck$LassoCheckResult]: Stem: 1422#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1417#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1418#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1419#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1421#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1423#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1441#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1440#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1439#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1438#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1437#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1436#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1435#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1434#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1433#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1432#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1431#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1430#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1429#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1428#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1427#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1426#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1425#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1424#L19-3 assume !(main_~i~0 < 11); 1415#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1416#L26-2 [2020-07-29 01:42:47,679 INFO L796 eck$LassoCheckResult]: Loop: 1416#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1416#L26-2 [2020-07-29 01:42:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2020-07-29 01:42:47,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:47,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364006192] [2020-07-29 01:42:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:47,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:47,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:47,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2020-07-29 01:42:47,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:47,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284193529] [2020-07-29 01:42:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:47,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:47,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:47,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2020-07-29 01:42:47,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:47,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027676295] [2020-07-29 01:42:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:47,742 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:42:47,748 INFO L168 Benchmark]: Toolchain (without parser) took 10079.24 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 953.5 MB in the beginning and 1.3 GB in the end (delta: -330.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:42:47,749 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:42:47,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.64 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:47,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:47,750 INFO L168 Benchmark]: Boogie Preprocessor took 36.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:42:47,751 INFO L168 Benchmark]: RCFGBuilder took 439.79 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: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:47,752 INFO L168 Benchmark]: BuchiAutomizer took 9235.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:47,755 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.64 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.8 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 103.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 439.79 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: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9235.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...