./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/string-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/loops/string-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 006185a0f421290b8428ab97d6df7002802d9282 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:12:01,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:12:01,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:12:01,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:12:01,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:12:01,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:12:01,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:12:01,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:12:01,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:12:01,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:12:01,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:12:01,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:12:01,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:12:01,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:12:01,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:12:01,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:12:01,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:12:01,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:12:01,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:12:01,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:12:01,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:12:01,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:12:01,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:12:01,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:12:01,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:12:01,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:12:01,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:12:01,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:12:01,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:12:01,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:12:01,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:12:01,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:12:01,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:12:01,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:12:01,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:12:01,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:12:01,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:12:01,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:12:01,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:12:01,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:12:01,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:12:01,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:12:01,705 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:12:01,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:12:01,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:12:01,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:12:01,708 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:12:01,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:12:01,709 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:12:01,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:12:01,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:12:01,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:12:01,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:12:01,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:12:01,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:12:01,711 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:12:01,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:12:01,711 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:12:01,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:12:01,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:12:01,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:12:01,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:12:01,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:12:01,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:01,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:12:01,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:12:01,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:12:01,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:12:01,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:12:01,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:12:01,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:12:01,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(__VERIFIER_error())) ) 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 -> 006185a0f421290b8428ab97d6df7002802d9282 [2020-07-28 18:12:02,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:12:02,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:12:02,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:12:02,050 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:12:02,050 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:12:02,051 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-1.i [2020-07-28 18:12:02,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4785b6/e458473ea52d4c11a91b4226870b71f2/FLAG404316de6 [2020-07-28 18:12:02,584 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:12:02,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i [2020-07-28 18:12:02,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4785b6/e458473ea52d4c11a91b4226870b71f2/FLAG404316de6 [2020-07-28 18:12:02,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4785b6/e458473ea52d4c11a91b4226870b71f2 [2020-07-28 18:12:02,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:12:02,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:12:02,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:02,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:12:02,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:12:02,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:02" (1/1) ... [2020-07-28 18:12:02,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6014ae41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:02, skipping insertion in model container [2020-07-28 18:12:02,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:02" (1/1) ... [2020-07-28 18:12:02,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:12:02,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:12:03,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:03,157 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:12:03,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:03,212 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:12:03,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03 WrapperNode [2020-07-28 18:12:03,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:03,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:03,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:12:03,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:12:03,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:03,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:12:03,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:12:03,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:12:03,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... [2020-07-28 18:12:03,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:12:03,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:12:03,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:12:03,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:12:03,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 18:12:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:12:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:12:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 18:12:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 18:12:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:12:04,006 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:12:04,007 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 18:12:04,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:04 BoogieIcfgContainer [2020-07-28 18:12:04,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:12:04,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:12:04,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:12:04,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:12:04,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:12:02" (1/3) ... [2020-07-28 18:12:04,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cfebb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:04, skipping insertion in model container [2020-07-28 18:12:04,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:03" (2/3) ... [2020-07-28 18:12:04,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cfebb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:04, skipping insertion in model container [2020-07-28 18:12:04,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:04" (3/3) ... [2020-07-28 18:12:04,019 INFO L109 eAbstractionObserver]: Analyzing ICFG string-1.i [2020-07-28 18:12:04,030 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:12:04,037 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:12:04,049 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:12:04,071 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:12:04,071 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:12:04,071 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:12:04,071 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:12:04,071 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:12:04,072 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:12:04,072 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:12:04,072 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:12:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-28 18:12:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 18:12:04,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:04,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:04,096 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2020-07-28 18:12:04,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:04,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486789839] [2020-07-28 18:12:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:04,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {29#true} is VALID [2020-07-28 18:12:04,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~nondet4, main_#t~post3, main_#t~mem5, main_#t~post7, main_#t~mem6, main_#t~post9, main_#t~mem8, main_#t~mem10, main_#t~mem11, main_#t~post12, main_#t~post13, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; {29#true} is VALID [2020-07-28 18:12:04,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#true} assume !(main_~i~0 < 5); {29#true} is VALID [2020-07-28 18:12:04,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {29#true} call main_#t~mem2 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); {29#true} is VALID [2020-07-28 18:12:04,261 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} assume !!(0 == main_#t~mem2);havoc main_#t~mem2;main_~i~0 := 0; {29#true} is VALID [2020-07-28 18:12:04,268 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} assume !true; {30#false} is VALID [2020-07-28 18:12:04,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#false} call main_#t~mem5 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); {30#false} is VALID [2020-07-28 18:12:04,269 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#false} assume !!(0 == main_#t~mem5);havoc main_#t~mem5;main_~nc_A~0 := 0; {30#false} is VALID [2020-07-28 18:12:04,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#false} assume !true; {30#false} is VALID [2020-07-28 18:12:04,269 INFO L280 TraceCheckUtils]: 9: Hoare triple {30#false} main_~nc_B~0 := 0; {30#false} is VALID [2020-07-28 18:12:04,270 INFO L280 TraceCheckUtils]: 10: Hoare triple {30#false} assume !true; {30#false} is VALID [2020-07-28 18:12:04,270 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; {30#false} is VALID [2020-07-28 18:12:04,271 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume !true; {30#false} is VALID [2020-07-28 18:12:04,271 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} main_~found~0 := (if main_~j~0 > main_~nc_B~0 - 1 then 1 else 0);__VERIFIER_assert_#in~cond := (if 0 == main_~found~0 || 1 == main_~found~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {30#false} is VALID [2020-07-28 18:12:04,272 INFO L280 TraceCheckUtils]: 14: Hoare triple {30#false} assume 0 == __VERIFIER_assert_~cond; {30#false} is VALID [2020-07-28 18:12:04,272 INFO L280 TraceCheckUtils]: 15: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-28 18:12:04,275 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-28 18:12:04,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486789839] [2020-07-28 18:12:04,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:04,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:12:04,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693780655] [2020-07-28 18:12:04,285 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-28 18:12:04,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:04,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:12:04,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:04,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:12:04,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:12:04,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:12:04,342 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2020-07-28 18:12:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:04,427 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2020-07-28 18:12:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:12:04,427 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-28 18:12:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:12:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2020-07-28 18:12:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:12:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2020-07-28 18:12:04,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2020-07-28 18:12:04,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:04,710 INFO L225 Difference]: With dead ends: 48 [2020-07-28 18:12:04,710 INFO L226 Difference]: Without dead ends: 22 [2020-07-28 18:12:04,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:12:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-28 18:12:04,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-28 18:12:04,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:04,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-28 18:12:04,751 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 18:12:04,752 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 18:12:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:04,756 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-28 18:12:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-28 18:12:04,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:04,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:04,757 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 18:12:04,758 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 18:12:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:04,764 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-28 18:12:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-28 18:12:04,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:04,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:04,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:04,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 18:12:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-28 18:12:04,770 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2020-07-28 18:12:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:04,771 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-28 18:12:04,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:12:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-28 18:12:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 18:12:04,772 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:04,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:04,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:12:04,773 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2020-07-28 18:12:04,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:04,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949797845] [2020-07-28 18:12:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:04,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {165#true} is VALID [2020-07-28 18:12:04,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {165#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~nondet4, main_#t~post3, main_#t~mem5, main_#t~post7, main_#t~mem6, main_#t~post9, main_#t~mem8, main_#t~mem10, main_#t~mem11, main_#t~post12, main_#t~post13, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; {167#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:04,839 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < 5); {166#false} is VALID [2020-07-28 18:12:04,839 INFO L280 TraceCheckUtils]: 3: Hoare triple {166#false} call main_#t~mem2 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); {166#false} is VALID [2020-07-28 18:12:04,839 INFO L280 TraceCheckUtils]: 4: Hoare triple {166#false} assume !!(0 == main_#t~mem2);havoc main_#t~mem2;main_~i~0 := 0; {166#false} is VALID [2020-07-28 18:12:04,840 INFO L280 TraceCheckUtils]: 5: Hoare triple {166#false} assume !(main_~i~0 < 5); {166#false} is VALID [2020-07-28 18:12:04,840 INFO L280 TraceCheckUtils]: 6: Hoare triple {166#false} call main_#t~mem5 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); {166#false} is VALID [2020-07-28 18:12:04,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {166#false} assume !!(0 == main_#t~mem5);havoc main_#t~mem5;main_~nc_A~0 := 0; {166#false} is VALID [2020-07-28 18:12:04,841 INFO L280 TraceCheckUtils]: 8: Hoare triple {166#false} call main_#t~mem6 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); {166#false} is VALID [2020-07-28 18:12:04,841 INFO L280 TraceCheckUtils]: 9: Hoare triple {166#false} assume !(0 != main_#t~mem6);havoc main_#t~mem6; {166#false} is VALID [2020-07-28 18:12:04,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {166#false} main_~nc_B~0 := 0; {166#false} is VALID [2020-07-28 18:12:04,842 INFO L280 TraceCheckUtils]: 11: Hoare triple {166#false} call main_#t~mem8 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); {166#false} is VALID [2020-07-28 18:12:04,842 INFO L280 TraceCheckUtils]: 12: Hoare triple {166#false} assume !(0 != main_#t~mem8);havoc main_#t~mem8; {166#false} is VALID [2020-07-28 18:12:04,842 INFO L280 TraceCheckUtils]: 13: Hoare triple {166#false} assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; {166#false} is VALID [2020-07-28 18:12:04,843 INFO L280 TraceCheckUtils]: 14: Hoare triple {166#false} assume !(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); {166#false} is VALID [2020-07-28 18:12:04,843 INFO L280 TraceCheckUtils]: 15: Hoare triple {166#false} main_~found~0 := (if main_~j~0 > main_~nc_B~0 - 1 then 1 else 0);__VERIFIER_assert_#in~cond := (if 0 == main_~found~0 || 1 == main_~found~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {166#false} is VALID [2020-07-28 18:12:04,843 INFO L280 TraceCheckUtils]: 16: Hoare triple {166#false} assume 0 == __VERIFIER_assert_~cond; {166#false} is VALID [2020-07-28 18:12:04,843 INFO L280 TraceCheckUtils]: 17: Hoare triple {166#false} assume !false; {166#false} is VALID [2020-07-28 18:12:04,845 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-28 18:12:04,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949797845] [2020-07-28 18:12:04,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:04,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:12:04,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248500817] [2020-07-28 18:12:04,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-28 18:12:04,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:04,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:12:04,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:04,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:12:04,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:12:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:12:04,887 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2020-07-28 18:12:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:05,025 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2020-07-28 18:12:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:12:05,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-28 18:12:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2020-07-28 18:12:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2020-07-28 18:12:05,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2020-07-28 18:12:05,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:05,131 INFO L225 Difference]: With dead ends: 50 [2020-07-28 18:12:05,132 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 18:12:05,133 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:12:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 18:12:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2020-07-28 18:12:05,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:05,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 24 states. [2020-07-28 18:12:05,146 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 24 states. [2020-07-28 18:12:05,146 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 24 states. [2020-07-28 18:12:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:05,149 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-28 18:12:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-28 18:12:05,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:05,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:05,150 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 32 states. [2020-07-28 18:12:05,151 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 32 states. [2020-07-28 18:12:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:05,154 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-28 18:12:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-28 18:12:05,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:05,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:05,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:05,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 18:12:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-28 18:12:05,159 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2020-07-28 18:12:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:05,159 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-28 18:12:05,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:12:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-28 18:12:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-28 18:12:05,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:05,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:05,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:12:05,162 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:05,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:05,162 INFO L82 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2020-07-28 18:12:05,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:05,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536146745] [2020-07-28 18:12:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:05,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {327#true} is VALID [2020-07-28 18:12:05,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {327#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~nondet4, main_#t~post3, main_#t~mem5, main_#t~post7, main_#t~mem6, main_#t~post9, main_#t~mem8, main_#t~mem10, main_#t~mem11, main_#t~post12, main_#t~post13, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; {329#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:05,235 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;call write~int(main_#t~nondet1, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {329#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:05,236 INFO L280 TraceCheckUtils]: 3: Hoare triple {329#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {330#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:05,237 INFO L280 TraceCheckUtils]: 4: Hoare triple {330#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < 5); {328#false} is VALID [2020-07-28 18:12:05,237 INFO L280 TraceCheckUtils]: 5: Hoare triple {328#false} call main_#t~mem2 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); {328#false} is VALID [2020-07-28 18:12:05,238 INFO L280 TraceCheckUtils]: 6: Hoare triple {328#false} assume !!(0 == main_#t~mem2);havoc main_#t~mem2;main_~i~0 := 0; {328#false} is VALID [2020-07-28 18:12:05,238 INFO L280 TraceCheckUtils]: 7: Hoare triple {328#false} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet4 && main_#t~nondet4 <= 127;call write~int(main_#t~nondet4, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet4; {328#false} is VALID [2020-07-28 18:12:05,239 INFO L280 TraceCheckUtils]: 8: Hoare triple {328#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {328#false} is VALID [2020-07-28 18:12:05,239 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#false} assume !(main_~i~0 < 5); {328#false} is VALID [2020-07-28 18:12:05,239 INFO L280 TraceCheckUtils]: 10: Hoare triple {328#false} call main_#t~mem5 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); {328#false} is VALID [2020-07-28 18:12:05,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {328#false} assume !!(0 == main_#t~mem5);havoc main_#t~mem5;main_~nc_A~0 := 0; {328#false} is VALID [2020-07-28 18:12:05,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {328#false} call main_#t~mem6 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); {328#false} is VALID [2020-07-28 18:12:05,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(0 != main_#t~mem6);havoc main_#t~mem6; {328#false} is VALID [2020-07-28 18:12:05,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {328#false} main_~nc_B~0 := 0; {328#false} is VALID [2020-07-28 18:12:05,241 INFO L280 TraceCheckUtils]: 15: Hoare triple {328#false} call main_#t~mem8 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); {328#false} is VALID [2020-07-28 18:12:05,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {328#false} assume !(0 != main_#t~mem8);havoc main_#t~mem8; {328#false} is VALID [2020-07-28 18:12:05,242 INFO L280 TraceCheckUtils]: 17: Hoare triple {328#false} assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; {328#false} is VALID [2020-07-28 18:12:05,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {328#false} assume !(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); {328#false} is VALID [2020-07-28 18:12:05,242 INFO L280 TraceCheckUtils]: 19: Hoare triple {328#false} main_~found~0 := (if main_~j~0 > main_~nc_B~0 - 1 then 1 else 0);__VERIFIER_assert_#in~cond := (if 0 == main_~found~0 || 1 == main_~found~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {328#false} is VALID [2020-07-28 18:12:05,243 INFO L280 TraceCheckUtils]: 20: Hoare triple {328#false} assume 0 == __VERIFIER_assert_~cond; {328#false} is VALID [2020-07-28 18:12:05,243 INFO L280 TraceCheckUtils]: 21: Hoare triple {328#false} assume !false; {328#false} is VALID [2020-07-28 18:12:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:12:05,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536146745] [2020-07-28 18:12:05,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225510417] [2020-07-28 18:12:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:05,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 18:12:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:05,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:05,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {327#true} is VALID [2020-07-28 18:12:05,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {327#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~nondet4, main_#t~post3, main_#t~mem5, main_#t~post7, main_#t~mem6, main_#t~post9, main_#t~mem8, main_#t~mem10, main_#t~mem11, main_#t~post12, main_#t~post13, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; {337#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:12:05,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {337#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;call write~int(main_#t~nondet1, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {337#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 18:12:05,457 INFO L280 TraceCheckUtils]: 3: Hoare triple {337#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {330#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:05,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {330#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < 5); {328#false} is VALID [2020-07-28 18:12:05,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {328#false} call main_#t~mem2 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); {328#false} is VALID [2020-07-28 18:12:05,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {328#false} assume !!(0 == main_#t~mem2);havoc main_#t~mem2;main_~i~0 := 0; {328#false} is VALID [2020-07-28 18:12:05,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {328#false} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet4 && main_#t~nondet4 <= 127;call write~int(main_#t~nondet4, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet4; {328#false} is VALID [2020-07-28 18:12:05,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {328#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {328#false} is VALID [2020-07-28 18:12:05,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#false} assume !(main_~i~0 < 5); {328#false} is VALID [2020-07-28 18:12:05,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {328#false} call main_#t~mem5 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); {328#false} is VALID [2020-07-28 18:12:05,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {328#false} assume !!(0 == main_#t~mem5);havoc main_#t~mem5;main_~nc_A~0 := 0; {328#false} is VALID [2020-07-28 18:12:05,461 INFO L280 TraceCheckUtils]: 12: Hoare triple {328#false} call main_#t~mem6 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); {328#false} is VALID [2020-07-28 18:12:05,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(0 != main_#t~mem6);havoc main_#t~mem6; {328#false} is VALID [2020-07-28 18:12:05,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {328#false} main_~nc_B~0 := 0; {328#false} is VALID [2020-07-28 18:12:05,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {328#false} call main_#t~mem8 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); {328#false} is VALID [2020-07-28 18:12:05,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {328#false} assume !(0 != main_#t~mem8);havoc main_#t~mem8; {328#false} is VALID [2020-07-28 18:12:05,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {328#false} assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; {328#false} is VALID [2020-07-28 18:12:05,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {328#false} assume !(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); {328#false} is VALID [2020-07-28 18:12:05,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {328#false} main_~found~0 := (if main_~j~0 > main_~nc_B~0 - 1 then 1 else 0);__VERIFIER_assert_#in~cond := (if 0 == main_~found~0 || 1 == main_~found~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {328#false} is VALID [2020-07-28 18:12:05,464 INFO L280 TraceCheckUtils]: 20: Hoare triple {328#false} assume 0 == __VERIFIER_assert_~cond; {328#false} is VALID [2020-07-28 18:12:05,465 INFO L280 TraceCheckUtils]: 21: Hoare triple {328#false} assume !false; {328#false} is VALID [2020-07-28 18:12:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:12:05,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:05,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-28 18:12:05,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022504248] [2020-07-28 18:12:05,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-28 18:12:05,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:05,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:12:05,503 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-28 18:12:05,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:12:05,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:05,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:12:05,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:05,505 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 5 states. [2020-07-28 18:12:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:05,674 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2020-07-28 18:12:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:05,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-28 18:12:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-28 18:12:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-28 18:12:05,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2020-07-28 18:12:05,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:05,785 INFO L225 Difference]: With dead ends: 61 [2020-07-28 18:12:05,785 INFO L226 Difference]: Without dead ends: 42 [2020-07-28 18:12:05,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-28 18:12:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2020-07-28 18:12:05,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:05,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 28 states. [2020-07-28 18:12:05,798 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 28 states. [2020-07-28 18:12:05,798 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 28 states. [2020-07-28 18:12:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:05,802 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-28 18:12:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-28 18:12:05,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:05,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:05,804 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 42 states. [2020-07-28 18:12:05,804 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 42 states. [2020-07-28 18:12:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:05,807 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-28 18:12:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-28 18:12:05,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:05,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:05,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:05,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 18:12:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-07-28 18:12:05,811 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2020-07-28 18:12:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:05,812 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-07-28 18:12:05,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:12:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-28 18:12:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 18:12:05,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:05,814 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:06,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:12:06,018 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:06,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 2 times [2020-07-28 18:12:06,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:06,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302543037] [2020-07-28 18:12:06,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:06,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {595#true} is VALID [2020-07-28 18:12:06,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {595#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~nondet4, main_#t~post3, main_#t~mem5, main_#t~post7, main_#t~mem6, main_#t~post9, main_#t~mem8, main_#t~mem10, main_#t~mem11, main_#t~post12, main_#t~post13, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; {597#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:06,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {597#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;call write~int(main_#t~nondet1, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {597#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:12:06,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {597#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {598#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:06,123 INFO L280 TraceCheckUtils]: 4: Hoare triple {598#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;call write~int(main_#t~nondet1, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {598#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:06,124 INFO L280 TraceCheckUtils]: 5: Hoare triple {598#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {599#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:06,125 INFO L280 TraceCheckUtils]: 6: Hoare triple {599#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < 5); {596#false} is VALID [2020-07-28 18:12:06,125 INFO L280 TraceCheckUtils]: 7: Hoare triple {596#false} call main_#t~mem2 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); {596#false} is VALID [2020-07-28 18:12:06,126 INFO L280 TraceCheckUtils]: 8: Hoare triple {596#false} assume !!(0 == main_#t~mem2);havoc main_#t~mem2;main_~i~0 := 0; {596#false} is VALID [2020-07-28 18:12:06,126 INFO L280 TraceCheckUtils]: 9: Hoare triple {596#false} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet4 && main_#t~nondet4 <= 127;call write~int(main_#t~nondet4, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet4; {596#false} is VALID [2020-07-28 18:12:06,127 INFO L280 TraceCheckUtils]: 10: Hoare triple {596#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {596#false} is VALID [2020-07-28 18:12:06,127 INFO L280 TraceCheckUtils]: 11: Hoare triple {596#false} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet4 && main_#t~nondet4 <= 127;call write~int(main_#t~nondet4, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet4; {596#false} is VALID [2020-07-28 18:12:06,127 INFO L280 TraceCheckUtils]: 12: Hoare triple {596#false} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {596#false} is VALID [2020-07-28 18:12:06,127 INFO L280 TraceCheckUtils]: 13: Hoare triple {596#false} assume !(main_~i~0 < 5); {596#false} is VALID [2020-07-28 18:12:06,128 INFO L280 TraceCheckUtils]: 14: Hoare triple {596#false} call main_#t~mem5 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); {596#false} is VALID [2020-07-28 18:12:06,128 INFO L280 TraceCheckUtils]: 15: Hoare triple {596#false} assume !!(0 == main_#t~mem5);havoc main_#t~mem5;main_~nc_A~0 := 0; {596#false} is VALID [2020-07-28 18:12:06,129 INFO L280 TraceCheckUtils]: 16: Hoare triple {596#false} call main_#t~mem6 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); {596#false} is VALID [2020-07-28 18:12:06,129 INFO L280 TraceCheckUtils]: 17: Hoare triple {596#false} assume !(0 != main_#t~mem6);havoc main_#t~mem6; {596#false} is VALID [2020-07-28 18:12:06,129 INFO L280 TraceCheckUtils]: 18: Hoare triple {596#false} main_~nc_B~0 := 0; {596#false} is VALID [2020-07-28 18:12:06,130 INFO L280 TraceCheckUtils]: 19: Hoare triple {596#false} call main_#t~mem8 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); {596#false} is VALID [2020-07-28 18:12:06,130 INFO L280 TraceCheckUtils]: 20: Hoare triple {596#false} assume !(0 != main_#t~mem8);havoc main_#t~mem8; {596#false} is VALID [2020-07-28 18:12:06,130 INFO L280 TraceCheckUtils]: 21: Hoare triple {596#false} assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; {596#false} is VALID [2020-07-28 18:12:06,131 INFO L280 TraceCheckUtils]: 22: Hoare triple {596#false} assume !(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); {596#false} is VALID [2020-07-28 18:12:06,131 INFO L280 TraceCheckUtils]: 23: Hoare triple {596#false} main_~found~0 := (if main_~j~0 > main_~nc_B~0 - 1 then 1 else 0);__VERIFIER_assert_#in~cond := (if 0 == main_~found~0 || 1 == main_~found~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {596#false} is VALID [2020-07-28 18:12:06,132 INFO L280 TraceCheckUtils]: 24: Hoare triple {596#false} assume 0 == __VERIFIER_assert_~cond; {596#false} is VALID [2020-07-28 18:12:06,132 INFO L280 TraceCheckUtils]: 25: Hoare triple {596#false} assume !false; {596#false} is VALID [2020-07-28 18:12:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 18:12:06,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302543037] [2020-07-28 18:12:06,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177124041] [2020-07-28 18:12:06,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:06,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 18:12:06,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:06,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 18:12:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:06,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:06,375 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:06,407 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:06,439 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:06,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {595#true} is VALID [2020-07-28 18:12:06,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {595#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~nondet4, main_#t~post3, main_#t~mem5, main_#t~post7, main_#t~mem6, main_#t~post9, main_#t~mem8, main_#t~mem10, main_#t~mem11, main_#t~post12, main_#t~post13, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; {595#true} is VALID [2020-07-28 18:12:06,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {595#true} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;call write~int(main_#t~nondet1, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {595#true} is VALID [2020-07-28 18:12:06,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {595#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {595#true} is VALID [2020-07-28 18:12:06,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {595#true} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;call write~int(main_#t~nondet1, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet1; {595#true} is VALID [2020-07-28 18:12:06,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {595#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {595#true} is VALID [2020-07-28 18:12:06,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {595#true} assume !(main_~i~0 < 5); {595#true} is VALID [2020-07-28 18:12:06,491 INFO L280 TraceCheckUtils]: 7: Hoare triple {595#true} call main_#t~mem2 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); {595#true} is VALID [2020-07-28 18:12:06,492 INFO L280 TraceCheckUtils]: 8: Hoare triple {595#true} assume !!(0 == main_#t~mem2);havoc main_#t~mem2;main_~i~0 := 0; {595#true} is VALID [2020-07-28 18:12:06,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {595#true} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet4 && main_#t~nondet4 <= 127;call write~int(main_#t~nondet4, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet4; {595#true} is VALID [2020-07-28 18:12:06,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {595#true} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {595#true} is VALID [2020-07-28 18:12:06,493 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#true} assume !!(main_~i~0 < 5);assume -128 <= main_#t~nondet4 && main_#t~nondet4 <= 127;call write~int(main_#t~nondet4, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet4; {595#true} is VALID [2020-07-28 18:12:06,493 INFO L280 TraceCheckUtils]: 12: Hoare triple {595#true} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {595#true} is VALID [2020-07-28 18:12:06,493 INFO L280 TraceCheckUtils]: 13: Hoare triple {595#true} assume !(main_~i~0 < 5); {595#true} is VALID [2020-07-28 18:12:06,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {595#true} call main_#t~mem5 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); {595#true} is VALID [2020-07-28 18:12:06,494 INFO L280 TraceCheckUtils]: 15: Hoare triple {595#true} assume !!(0 == main_#t~mem5);havoc main_#t~mem5;main_~nc_A~0 := 0; {595#true} is VALID [2020-07-28 18:12:06,494 INFO L280 TraceCheckUtils]: 16: Hoare triple {595#true} call main_#t~mem6 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); {595#true} is VALID [2020-07-28 18:12:06,494 INFO L280 TraceCheckUtils]: 17: Hoare triple {595#true} assume !(0 != main_#t~mem6);havoc main_#t~mem6; {595#true} is VALID [2020-07-28 18:12:06,495 INFO L280 TraceCheckUtils]: 18: Hoare triple {595#true} main_~nc_B~0 := 0; {657#(<= ULTIMATE.start_main_~nc_B~0 0)} is VALID [2020-07-28 18:12:06,496 INFO L280 TraceCheckUtils]: 19: Hoare triple {657#(<= ULTIMATE.start_main_~nc_B~0 0)} call main_#t~mem8 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); {657#(<= ULTIMATE.start_main_~nc_B~0 0)} is VALID [2020-07-28 18:12:06,497 INFO L280 TraceCheckUtils]: 20: Hoare triple {657#(<= ULTIMATE.start_main_~nc_B~0 0)} assume !(0 != main_#t~mem8);havoc main_#t~mem8; {657#(<= ULTIMATE.start_main_~nc_B~0 0)} is VALID [2020-07-28 18:12:06,498 INFO L280 TraceCheckUtils]: 21: Hoare triple {657#(<= ULTIMATE.start_main_~nc_B~0 0)} assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; {667#(and (<= 0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~nc_B~0 0))} is VALID [2020-07-28 18:12:06,499 INFO L280 TraceCheckUtils]: 22: Hoare triple {667#(and (<= 0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~nc_B~0 0))} assume !(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); {667#(and (<= 0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~nc_B~0 0))} is VALID [2020-07-28 18:12:06,500 INFO L280 TraceCheckUtils]: 23: Hoare triple {667#(and (<= 0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~nc_B~0 0))} main_~found~0 := (if main_~j~0 > main_~nc_B~0 - 1 then 1 else 0);__VERIFIER_assert_#in~cond := (if 0 == main_~found~0 || 1 == main_~found~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {674#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:06,501 INFO L280 TraceCheckUtils]: 24: Hoare triple {674#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {596#false} is VALID [2020-07-28 18:12:06,502 INFO L280 TraceCheckUtils]: 25: Hoare triple {596#false} assume !false; {596#false} is VALID [2020-07-28 18:12:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-28 18:12:06,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:12:06,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-07-28 18:12:06,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033195498] [2020-07-28 18:12:06,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-28 18:12:06,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:06,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:12:06,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:06,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:12:06,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:06,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:12:06,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:06,544 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2020-07-28 18:12:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:06,683 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2020-07-28 18:12:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:12:06,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-28 18:12:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-28 18:12:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-28 18:12:06,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2020-07-28 18:12:06,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:06,753 INFO L225 Difference]: With dead ends: 38 [2020-07-28 18:12:06,753 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:12:06,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:12:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:12:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:12:06,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:06,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:06,756 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:06,756 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:06,757 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:12:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:06,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:06,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:06,757 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:06,757 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:06,758 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:12:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:06,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:06,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:06,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:06,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:12:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:12:06,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-28 18:12:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:06,761 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:12:06,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:12:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:06,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:06,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:06,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:12:07,008 INFO L271 CegarLoopResult]: At program point L35-3(lines 35 36) the Hoare annotation is: true [2020-07-28 18:12:07,009 INFO L268 CegarLoopResult]: For program point L35-4(lines 18 61) no Hoare annotation was computed. [2020-07-28 18:12:07,009 INFO L268 CegarLoopResult]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2020-07-28 18:12:07,009 INFO L271 CegarLoopResult]: At program point L31-3(lines 31 32) the Hoare annotation is: true [2020-07-28 18:12:07,009 INFO L271 CegarLoopResult]: At program point L60(lines 17 61) the Hoare annotation is: true [2020-07-28 18:12:07,009 INFO L268 CegarLoopResult]: For program point L31-4(lines 31 32) no Hoare annotation was computed. [2020-07-28 18:12:07,009 INFO L268 CegarLoopResult]: For program point L44(lines 44 53) no Hoare annotation was computed. [2020-07-28 18:12:07,009 INFO L271 CegarLoopResult]: At program point L44-2(lines 42 54) the Hoare annotation is: true [2020-07-28 18:12:07,010 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:12:07,010 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:12:07,010 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:12:07,010 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-28 18:12:07,010 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-28 18:12:07,010 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-28 18:12:07,010 INFO L268 CegarLoopResult]: For program point L8(lines 8 10) no Hoare annotation was computed. [2020-07-28 18:12:07,010 INFO L271 CegarLoopResult]: At program point L8-2(lines 7 12) the Hoare annotation is: true [2020-07-28 18:12:07,011 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:12:07,011 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-28 18:12:07,011 INFO L268 CegarLoopResult]: For program point L42-2(lines 42 54) no Hoare annotation was computed. [2020-07-28 18:12:07,011 INFO L268 CegarLoopResult]: For program point L26-2(lines 26 27) no Hoare annotation was computed. [2020-07-28 18:12:07,011 INFO L271 CegarLoopResult]: At program point L26-3(lines 26 27) the Hoare annotation is: true [2020-07-28 18:12:07,011 INFO L268 CegarLoopResult]: For program point L26-4(lines 26 27) no Hoare annotation was computed. [2020-07-28 18:12:07,011 INFO L268 CegarLoopResult]: For program point L22-2(lines 22 23) no Hoare annotation was computed. [2020-07-28 18:12:07,011 INFO L271 CegarLoopResult]: At program point L22-3(lines 22 23) the Hoare annotation is: true [2020-07-28 18:12:07,012 INFO L268 CegarLoopResult]: For program point L22-4(lines 22 23) no Hoare annotation was computed. [2020-07-28 18:12:07,012 INFO L268 CegarLoopResult]: For program point L35-1(lines 35 36) no Hoare annotation was computed. [2020-07-28 18:12:07,017 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:12:07,017 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:12:07,017 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-28 18:12:07,017 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2020-07-28 18:12:07,018 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-28 18:12:07,019 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-28 18:12:07,020 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-28 18:12:07,021 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 18:12:07,021 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-28 18:12:07,021 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 18:12:07,021 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 18:12:07,021 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:12:07,021 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:12:07,021 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 18:12:07,021 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 18:12:07,022 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:12:07,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:12:07 BoogieIcfgContainer [2020-07-28 18:12:07,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:12:07,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:12:07,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:12:07,031 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:12:07,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:04" (3/4) ... [2020-07-28 18:12:07,035 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:12:07,048 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-07-28 18:12:07,048 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 18:12:07,049 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 18:12:07,119 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:12:07,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:12:07,126 INFO L168 Benchmark]: Toolchain (without parser) took 4207.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 950.8 MB in the beginning and 809.3 MB in the end (delta: 141.5 MB). Peak memory consumption was 271.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:07,126 INFO L168 Benchmark]: CDTParser took 1.12 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-28 18:12:07,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.54 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:07,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:07,128 INFO L168 Benchmark]: Boogie Preprocessor took 34.87 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-28 18:12:07,134 INFO L168 Benchmark]: RCFGBuilder took 637.09 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:07,135 INFO L168 Benchmark]: TraceAbstraction took 3018.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 816.0 MB in the end (delta: 271.3 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:07,135 INFO L168 Benchmark]: Witness Printer took 89.04 ms. Allocated memory is still 1.2 GB. Free memory was 816.0 MB in the beginning and 809.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:07,138 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 1.12 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 292.54 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 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 124.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.87 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 637.09 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3018.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 816.0 MB in the end (delta: 271.3 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. * Witness Printer took 89.04 ms. Allocated memory is still 1.2 GB. Free memory was 816.0 MB in the beginning and 809.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 92 SDtfs, 31 SDslu, 80 SDs, 0 SdLazy, 64 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 19 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 130 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 3682 SizeOfPredicates, 6 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 14/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...