java -ea -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:18:21,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:18:21,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:18:21,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:18:21,681 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:18:21,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:18:21,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:18:21,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:18:21,687 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:18:21,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:18:21,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:18:21,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:18:21,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:18:21,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:18:21,693 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:18:21,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:18:21,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:18:21,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:18:21,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:18:21,700 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:18:21,701 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:18:21,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:18:21,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:18:21,706 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:18:21,706 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:18:21,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:18:21,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:18:21,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:18:21,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:18:21,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:18:21,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:18:21,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:18:21,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:18:21,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:18:21,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:18:21,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:18:21,715 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:18:21,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:18:21,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:18:21,731 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:18:21,731 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:18:21,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:18:21,732 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:18:21,732 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:18:21,733 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:18:21,733 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:18:21,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:18:21,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:18:21,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:18:21,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:18:21,734 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:18:21,734 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:18:21,734 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:18:21,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:18:21,734 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:18:21,735 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:18:21,735 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:18:21,735 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:18:21,735 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:18:21,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:18:21,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:18:21,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:18:21,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:18:21,736 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:18:21,736 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:18:21,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:18:21,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:18:21,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:18:21,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:18:21,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:18:21,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:18:21,828 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:18:21,828 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:18:21,829 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-11-14 19:18:21,900 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc06dd0a/198ebd472dc44b2eba197f5bfe8391c8/FLAGf4e7b0bd2 [2018-11-14 19:18:22,412 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:18:22,413 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-11-14 19:18:22,420 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc06dd0a/198ebd472dc44b2eba197f5bfe8391c8/FLAGf4e7b0bd2 [2018-11-14 19:18:22,441 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc06dd0a/198ebd472dc44b2eba197f5bfe8391c8 [2018-11-14 19:18:22,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:18:22,455 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:18:22,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:18:22,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:18:22,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:18:22,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f7d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22, skipping insertion in model container [2018-11-14 19:18:22,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:18:22,506 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:18:22,702 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:18:22,707 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:18:22,740 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:18:22,764 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:18:22,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22 WrapperNode [2018-11-14 19:18:22,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:18:22,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:18:22,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:18:22,766 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:18:22,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (1/1) ... [2018-11-14 19:18:22,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:18:22,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:18:22,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:18:22,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:18:22,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (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 [2018-11-14 19:18:23,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:18:23,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:18:23,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:18:23,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:18:23,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:18:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:18:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:18:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-14 19:18:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:18:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:18:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:18:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:18:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:18:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:18:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:18:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:18:24,011 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:18:24,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:18:24 BoogieIcfgContainer [2018-11-14 19:18:24,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:18:24,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:18:24,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:18:24,018 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:18:24,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:18:22" (1/3) ... [2018-11-14 19:18:24,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be898f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:18:24, skipping insertion in model container [2018-11-14 19:18:24,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:22" (2/3) ... [2018-11-14 19:18:24,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be898f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:18:24, skipping insertion in model container [2018-11-14 19:18:24,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:18:24" (3/3) ... [2018-11-14 19:18:24,023 INFO L112 eAbstractionObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-11-14 19:18:24,036 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:18:24,049 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:18:24,071 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:18:24,115 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:18:24,116 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:18:24,117 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:18:24,117 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:18:24,117 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:18:24,118 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:18:24,118 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:18:24,118 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:18:24,119 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:18:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-14 19:18:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:18:24,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:24,162 INFO L375 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] [2018-11-14 19:18:24,164 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:24,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:24,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1091547452, now seen corresponding path program 1 times [2018-11-14 19:18:24,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:24,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:24,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:24,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:24,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:24,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2018-11-14 19:18:24,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43#true} is VALID [2018-11-14 19:18:24,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2018-11-14 19:18:24,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2018-11-14 19:18:24,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret15 := main(); {43#true} is VALID [2018-11-14 19:18:24,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {43#true} is VALID [2018-11-14 19:18:24,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#true} assume !true; {44#false} is VALID [2018-11-14 19:18:24,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#false} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {44#false} is VALID [2018-11-14 19:18:24,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {44#false} is VALID [2018-11-14 19:18:24,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 19:18:24,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#false} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {44#false} is VALID [2018-11-14 19:18:24,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {44#false} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {44#false} is VALID [2018-11-14 19:18:24,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 19:18:24,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {44#false} ~nc_B~0 := 0; {44#false} is VALID [2018-11-14 19:18:24,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 19:18:24,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {44#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {44#false} is VALID [2018-11-14 19:18:24,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 19:18:24,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {44#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {44#false} is VALID [2018-11-14 19:18:24,335 INFO L256 TraceCheckUtils]: 18: Hoare triple {44#false} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {44#false} is VALID [2018-11-14 19:18:24,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2018-11-14 19:18:24,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {44#false} assume ~cond == 0; {44#false} is VALID [2018-11-14 19:18:24,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID [2018-11-14 19:18:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:24,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:24,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:18:24,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 19:18:24,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:24,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:18:24,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:24,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:18:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:18:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:18:24,450 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-14 19:18:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:24,615 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2018-11-14 19:18:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:18:24,615 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 19:18:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:18:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 19:18:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:18:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 19:18:24,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2018-11-14 19:18:24,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:24,946 INFO L225 Difference]: With dead ends: 71 [2018-11-14 19:18:24,946 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 19:18:24,950 INFO L604 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 [2018-11-14 19:18:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 19:18:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 19:18:25,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:25,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 19:18:25,007 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 19:18:25,007 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 19:18:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:25,012 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 19:18:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 19:18:25,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:25,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:25,014 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 19:18:25,014 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 19:18:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:25,019 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 19:18:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 19:18:25,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:25,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:25,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:25,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 19:18:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 19:18:25,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2018-11-14 19:18:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:25,026 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 19:18:25,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:18:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 19:18:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 19:18:25,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:25,028 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:25,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:25,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash 499356089, now seen corresponding path program 1 times [2018-11-14 19:18:25,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:25,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:25,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:25,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {245#true} call ULTIMATE.init(); {245#true} is VALID [2018-11-14 19:18:25,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {245#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {245#true} is VALID [2018-11-14 19:18:25,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {245#true} assume true; {245#true} is VALID [2018-11-14 19:18:25,184 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} #112#return; {245#true} is VALID [2018-11-14 19:18:25,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {245#true} call #t~ret15 := main(); {245#true} is VALID [2018-11-14 19:18:25,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {245#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {247#(= main_~i~0 0)} is VALID [2018-11-14 19:18:25,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {247#(= main_~i~0 0)} assume true; {247#(= main_~i~0 0)} is VALID [2018-11-14 19:18:25,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {247#(= main_~i~0 0)} assume !(~i~0 < 5); {246#false} is VALID [2018-11-14 19:18:25,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {246#false} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {246#false} is VALID [2018-11-14 19:18:25,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {246#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {246#false} is VALID [2018-11-14 19:18:25,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {246#false} assume true; {246#false} is VALID [2018-11-14 19:18:25,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {246#false} assume !(~i~0 < 5); {246#false} is VALID [2018-11-14 19:18:25,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {246#false} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {246#false} is VALID [2018-11-14 19:18:25,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {246#false} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {246#false} is VALID [2018-11-14 19:18:25,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {246#false} assume true; {246#false} is VALID [2018-11-14 19:18:25,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {246#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {246#false} is VALID [2018-11-14 19:18:25,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {246#false} assume !(#t~mem7 != 0);havoc #t~mem7; {246#false} is VALID [2018-11-14 19:18:25,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {246#false} ~nc_B~0 := 0; {246#false} is VALID [2018-11-14 19:18:25,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {246#false} assume true; {246#false} is VALID [2018-11-14 19:18:25,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {246#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {246#false} is VALID [2018-11-14 19:18:25,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {246#false} assume !(#t~mem9 != 0);havoc #t~mem9; {246#false} is VALID [2018-11-14 19:18:25,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {246#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {246#false} is VALID [2018-11-14 19:18:25,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {246#false} assume true; {246#false} is VALID [2018-11-14 19:18:25,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {246#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {246#false} is VALID [2018-11-14 19:18:25,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {246#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {246#false} is VALID [2018-11-14 19:18:25,232 INFO L256 TraceCheckUtils]: 25: Hoare triple {246#false} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {246#false} is VALID [2018-11-14 19:18:25,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {246#false} ~cond := #in~cond; {246#false} is VALID [2018-11-14 19:18:25,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {246#false} assume ~cond == 0; {246#false} is VALID [2018-11-14 19:18:25,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {246#false} assume !false; {246#false} is VALID [2018-11-14 19:18:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:25,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:25,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:18:25,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 19:18:25,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:25,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:18:25,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:25,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:18:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:18:25,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:18:25,478 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-11-14 19:18:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:25,746 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-11-14 19:18:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:18:25,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 19:18:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:18:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 19:18:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:18:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 19:18:25,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2018-11-14 19:18:25,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:25,999 INFO L225 Difference]: With dead ends: 68 [2018-11-14 19:18:26,000 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 19:18:26,001 INFO L604 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 [2018-11-14 19:18:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 19:18:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-14 19:18:26,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:26,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 37 states. [2018-11-14 19:18:26,022 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 37 states. [2018-11-14 19:18:26,023 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 37 states. [2018-11-14 19:18:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:26,026 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-14 19:18:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 19:18:26,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:26,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:26,028 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 44 states. [2018-11-14 19:18:26,028 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 44 states. [2018-11-14 19:18:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:26,031 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-14 19:18:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 19:18:26,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:26,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:26,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:26,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:18:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-14 19:18:26,036 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2018-11-14 19:18:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:26,036 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-14 19:18:26,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:18:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 19:18:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 19:18:26,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:26,038 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:26,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:26,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1017977548, now seen corresponding path program 1 times [2018-11-14 19:18:26,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:26,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:26,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:26,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:26,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2018-11-14 19:18:26,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {477#true} is VALID [2018-11-14 19:18:26,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2018-11-14 19:18:26,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #112#return; {477#true} is VALID [2018-11-14 19:18:26,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret15 := main(); {477#true} is VALID [2018-11-14 19:18:26,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {477#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {479#(= main_~i~0 0)} is VALID [2018-11-14 19:18:26,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {479#(= main_~i~0 0)} assume true; {479#(= main_~i~0 0)} is VALID [2018-11-14 19:18:26,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {479#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {479#(= main_~i~0 0)} is VALID [2018-11-14 19:18:26,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {479#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {480#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:26,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {480#(<= main_~i~0 1)} assume true; {480#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:26,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {480#(<= main_~i~0 1)} assume !(~i~0 < 5); {478#false} is VALID [2018-11-14 19:18:26,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {478#false} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {478#false} is VALID [2018-11-14 19:18:26,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {478#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {478#false} is VALID [2018-11-14 19:18:26,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {478#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {478#false} is VALID [2018-11-14 19:18:26,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {478#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {478#false} is VALID [2018-11-14 19:18:26,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {478#false} assume !(~i~0 < 5); {478#false} is VALID [2018-11-14 19:18:26,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#false} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {478#false} is VALID [2018-11-14 19:18:26,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {478#false} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {478#false} is VALID [2018-11-14 19:18:26,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {478#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {478#false} is VALID [2018-11-14 19:18:26,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {478#false} assume !(#t~mem7 != 0);havoc #t~mem7; {478#false} is VALID [2018-11-14 19:18:26,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {478#false} ~nc_B~0 := 0; {478#false} is VALID [2018-11-14 19:18:26,184 INFO L273 TraceCheckUtils]: 24: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,185 INFO L273 TraceCheckUtils]: 25: Hoare triple {478#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {478#false} is VALID [2018-11-14 19:18:26,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {478#false} assume !(#t~mem9 != 0);havoc #t~mem9; {478#false} is VALID [2018-11-14 19:18:26,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {478#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {478#false} is VALID [2018-11-14 19:18:26,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {478#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {478#false} is VALID [2018-11-14 19:18:26,186 INFO L273 TraceCheckUtils]: 30: Hoare triple {478#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {478#false} is VALID [2018-11-14 19:18:26,186 INFO L256 TraceCheckUtils]: 31: Hoare triple {478#false} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {478#false} is VALID [2018-11-14 19:18:26,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {478#false} ~cond := #in~cond; {478#false} is VALID [2018-11-14 19:18:26,187 INFO L273 TraceCheckUtils]: 33: Hoare triple {478#false} assume ~cond == 0; {478#false} is VALID [2018-11-14 19:18:26,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {478#false} assume !false; {478#false} is VALID [2018-11-14 19:18:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:26,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:26,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:26,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:26,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:26,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2018-11-14 19:18:26,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {477#true} is VALID [2018-11-14 19:18:26,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2018-11-14 19:18:26,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #112#return; {477#true} is VALID [2018-11-14 19:18:26,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret15 := main(); {477#true} is VALID [2018-11-14 19:18:26,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {477#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {499#(<= main_~i~0 0)} is VALID [2018-11-14 19:18:26,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {499#(<= main_~i~0 0)} assume true; {499#(<= main_~i~0 0)} is VALID [2018-11-14 19:18:26,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {499#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {499#(<= main_~i~0 0)} is VALID [2018-11-14 19:18:26,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {499#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {480#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:26,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {480#(<= main_~i~0 1)} assume true; {480#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:26,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {480#(<= main_~i~0 1)} assume !(~i~0 < 5); {478#false} is VALID [2018-11-14 19:18:26,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {478#false} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {478#false} is VALID [2018-11-14 19:18:26,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {478#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {478#false} is VALID [2018-11-14 19:18:26,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {478#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {478#false} is VALID [2018-11-14 19:18:26,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {478#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {478#false} is VALID [2018-11-14 19:18:26,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {478#false} assume !(~i~0 < 5); {478#false} is VALID [2018-11-14 19:18:26,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#false} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {478#false} is VALID [2018-11-14 19:18:26,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {478#false} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {478#false} is VALID [2018-11-14 19:18:26,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {478#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {478#false} is VALID [2018-11-14 19:18:26,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {478#false} assume !(#t~mem7 != 0);havoc #t~mem7; {478#false} is VALID [2018-11-14 19:18:26,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {478#false} ~nc_B~0 := 0; {478#false} is VALID [2018-11-14 19:18:26,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {478#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {478#false} is VALID [2018-11-14 19:18:26,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {478#false} assume !(#t~mem9 != 0);havoc #t~mem9; {478#false} is VALID [2018-11-14 19:18:26,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {478#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {478#false} is VALID [2018-11-14 19:18:26,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {478#false} assume true; {478#false} is VALID [2018-11-14 19:18:26,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {478#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {478#false} is VALID [2018-11-14 19:18:26,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {478#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {478#false} is VALID [2018-11-14 19:18:26,913 INFO L256 TraceCheckUtils]: 31: Hoare triple {478#false} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {478#false} is VALID [2018-11-14 19:18:26,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {478#false} ~cond := #in~cond; {478#false} is VALID [2018-11-14 19:18:26,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {478#false} assume ~cond == 0; {478#false} is VALID [2018-11-14 19:18:26,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {478#false} assume !false; {478#false} is VALID [2018-11-14 19:18:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:26,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:26,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 19:18:26,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 19:18:26,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:26,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:18:27,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:27,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:18:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:18:27,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:18:27,108 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 5 states. [2018-11-14 19:18:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:27,389 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2018-11-14 19:18:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:18:27,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 19:18:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:18:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2018-11-14 19:18:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:18:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2018-11-14 19:18:27,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2018-11-14 19:18:27,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:27,555 INFO L225 Difference]: With dead ends: 81 [2018-11-14 19:18:27,555 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 19:18:27,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:18:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 19:18:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-11-14 19:18:27,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:27,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 43 states. [2018-11-14 19:18:27,584 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 43 states. [2018-11-14 19:18:27,584 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 43 states. [2018-11-14 19:18:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:27,588 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-14 19:18:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-14 19:18:27,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:27,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:27,590 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 55 states. [2018-11-14 19:18:27,590 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 55 states. [2018-11-14 19:18:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:27,593 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-14 19:18:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-14 19:18:27,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:27,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:27,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:27,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 19:18:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-14 19:18:27,598 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 35 [2018-11-14 19:18:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:27,598 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-14 19:18:27,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:18:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 19:18:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 19:18:27,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:27,600 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:27,601 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:27,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash -520435943, now seen corresponding path program 2 times [2018-11-14 19:18:27,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:27,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:27,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:27,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:27,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:27,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {861#true} call ULTIMATE.init(); {861#true} is VALID [2018-11-14 19:18:27,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {861#true} is VALID [2018-11-14 19:18:27,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:27,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {861#true} {861#true} #112#return; {861#true} is VALID [2018-11-14 19:18:27,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {861#true} call #t~ret15 := main(); {861#true} is VALID [2018-11-14 19:18:27,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {861#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {863#(= main_~i~0 0)} is VALID [2018-11-14 19:18:27,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {863#(= main_~i~0 0)} assume true; {863#(= main_~i~0 0)} is VALID [2018-11-14 19:18:27,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {863#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {863#(= main_~i~0 0)} is VALID [2018-11-14 19:18:27,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {863#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {864#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:27,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {864#(<= main_~i~0 1)} assume true; {864#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:27,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {864#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {864#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:27,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {864#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {865#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:27,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#(<= main_~i~0 2)} assume true; {865#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:27,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#(<= main_~i~0 2)} assume !(~i~0 < 5); {862#false} is VALID [2018-11-14 19:18:27,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {862#false} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {862#false} is VALID [2018-11-14 19:18:27,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {862#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {862#false} is VALID [2018-11-14 19:18:27,823 INFO L273 TraceCheckUtils]: 16: Hoare triple {862#false} assume true; {862#false} is VALID [2018-11-14 19:18:27,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {862#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {862#false} is VALID [2018-11-14 19:18:27,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {862#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {862#false} is VALID [2018-11-14 19:18:27,824 INFO L273 TraceCheckUtils]: 19: Hoare triple {862#false} assume true; {862#false} is VALID [2018-11-14 19:18:27,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {862#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {862#false} is VALID [2018-11-14 19:18:27,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {862#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {862#false} is VALID [2018-11-14 19:18:27,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {862#false} assume true; {862#false} is VALID [2018-11-14 19:18:27,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {862#false} assume !(~i~0 < 5); {862#false} is VALID [2018-11-14 19:18:27,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {862#false} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {862#false} is VALID [2018-11-14 19:18:27,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {862#false} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {862#false} is VALID [2018-11-14 19:18:27,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {862#false} assume true; {862#false} is VALID [2018-11-14 19:18:27,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {862#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {862#false} is VALID [2018-11-14 19:18:27,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {862#false} assume !(#t~mem7 != 0);havoc #t~mem7; {862#false} is VALID [2018-11-14 19:18:27,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {862#false} ~nc_B~0 := 0; {862#false} is VALID [2018-11-14 19:18:27,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {862#false} assume true; {862#false} is VALID [2018-11-14 19:18:27,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {862#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {862#false} is VALID [2018-11-14 19:18:27,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {862#false} assume !(#t~mem9 != 0);havoc #t~mem9; {862#false} is VALID [2018-11-14 19:18:27,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {862#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {862#false} is VALID [2018-11-14 19:18:27,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {862#false} assume true; {862#false} is VALID [2018-11-14 19:18:27,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {862#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {862#false} is VALID [2018-11-14 19:18:27,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {862#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {862#false} is VALID [2018-11-14 19:18:27,830 INFO L256 TraceCheckUtils]: 37: Hoare triple {862#false} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {862#false} is VALID [2018-11-14 19:18:27,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {862#false} ~cond := #in~cond; {862#false} is VALID [2018-11-14 19:18:27,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {862#false} assume ~cond == 0; {862#false} is VALID [2018-11-14 19:18:27,831 INFO L273 TraceCheckUtils]: 40: Hoare triple {862#false} assume !false; {862#false} is VALID [2018-11-14 19:18:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 19:18:27,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:27,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:27,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:27,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 19:18:27,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:27,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:28,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {861#true} call ULTIMATE.init(); {861#true} is VALID [2018-11-14 19:18:28,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {861#true} is VALID [2018-11-14 19:18:28,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:28,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {861#true} {861#true} #112#return; {861#true} is VALID [2018-11-14 19:18:28,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {861#true} call #t~ret15 := main(); {861#true} is VALID [2018-11-14 19:18:28,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {861#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {861#true} is VALID [2018-11-14 19:18:28,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:28,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {861#true} is VALID [2018-11-14 19:18:28,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {861#true} is VALID [2018-11-14 19:18:28,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:28,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {861#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {861#true} is VALID [2018-11-14 19:18:28,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {861#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {861#true} is VALID [2018-11-14 19:18:28,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:28,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {861#true} assume !(~i~0 < 5); {861#true} is VALID [2018-11-14 19:18:28,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {861#true} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {861#true} is VALID [2018-11-14 19:18:28,084 INFO L273 TraceCheckUtils]: 15: Hoare triple {861#true} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {861#true} is VALID [2018-11-14 19:18:28,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:28,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {861#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {861#true} is VALID [2018-11-14 19:18:28,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {861#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {861#true} is VALID [2018-11-14 19:18:28,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:28,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {861#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {861#true} is VALID [2018-11-14 19:18:28,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {861#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {861#true} is VALID [2018-11-14 19:18:28,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:28,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {861#true} assume !(~i~0 < 5); {861#true} is VALID [2018-11-14 19:18:28,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {861#true} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {861#true} is VALID [2018-11-14 19:18:28,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {861#true} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {861#true} is VALID [2018-11-14 19:18:28,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-14 19:18:28,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {861#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {861#true} is VALID [2018-11-14 19:18:28,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {861#true} assume !(#t~mem7 != 0);havoc #t~mem7; {861#true} is VALID [2018-11-14 19:18:28,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {861#true} ~nc_B~0 := 0; {956#(<= main_~nc_B~0 0)} is VALID [2018-11-14 19:18:28,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {956#(<= main_~nc_B~0 0)} assume true; {956#(<= main_~nc_B~0 0)} is VALID [2018-11-14 19:18:28,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {956#(<= main_~nc_B~0 0)} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {956#(<= main_~nc_B~0 0)} is VALID [2018-11-14 19:18:28,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {956#(<= main_~nc_B~0 0)} assume !(#t~mem9 != 0);havoc #t~mem9; {956#(<= main_~nc_B~0 0)} is VALID [2018-11-14 19:18:28,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {956#(<= main_~nc_B~0 0)} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {969#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} is VALID [2018-11-14 19:18:28,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {969#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} assume true; {969#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} is VALID [2018-11-14 19:18:28,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {969#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {969#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} is VALID [2018-11-14 19:18:28,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {969#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {979#(= 1 main_~found~0)} is VALID [2018-11-14 19:18:28,099 INFO L256 TraceCheckUtils]: 37: Hoare triple {979#(= 1 main_~found~0)} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {983#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:18:28,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {983#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {987#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:18:28,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {987#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {862#false} is VALID [2018-11-14 19:18:28,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {862#false} assume !false; {862#false} is VALID [2018-11-14 19:18:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 19:18:28,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:18:28,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-14 19:18:28,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-14 19:18:28,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:28,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:18:28,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:28,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:18:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:18:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:18:28,240 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-11-14 19:18:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:29,100 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-14 19:18:29,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:18:29,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-14 19:18:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:18:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2018-11-14 19:18:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:18:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2018-11-14 19:18:29,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 119 transitions. [2018-11-14 19:18:29,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:29,260 INFO L225 Difference]: With dead ends: 105 [2018-11-14 19:18:29,260 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 19:18:29,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:18:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 19:18:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-11-14 19:18:29,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:29,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 52 states. [2018-11-14 19:18:29,297 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 52 states. [2018-11-14 19:18:29,297 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 52 states. [2018-11-14 19:18:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:29,301 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 19:18:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 19:18:29,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:29,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:29,303 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 69 states. [2018-11-14 19:18:29,303 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 69 states. [2018-11-14 19:18:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:29,307 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 19:18:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 19:18:29,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:29,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:29,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:29,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 19:18:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-14 19:18:29,312 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 41 [2018-11-14 19:18:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:29,312 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-14 19:18:29,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:18:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 19:18:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 19:18:29,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:29,314 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:29,315 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:29,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1376702831, now seen corresponding path program 1 times [2018-11-14 19:18:29,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:29,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:29,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:29,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:29,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:29,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {1347#true} call ULTIMATE.init(); {1347#true} is VALID [2018-11-14 19:18:29,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {1347#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1347#true} is VALID [2018-11-14 19:18:29,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {1347#true} assume true; {1347#true} is VALID [2018-11-14 19:18:29,503 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1347#true} {1347#true} #112#return; {1347#true} is VALID [2018-11-14 19:18:29,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {1347#true} call #t~ret15 := main(); {1347#true} is VALID [2018-11-14 19:18:29,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {1347#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1349#(= main_~i~0 0)} is VALID [2018-11-14 19:18:29,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {1349#(= main_~i~0 0)} assume true; {1349#(= main_~i~0 0)} is VALID [2018-11-14 19:18:29,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {1349#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1349#(= main_~i~0 0)} is VALID [2018-11-14 19:18:29,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {1349#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1350#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:29,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {1350#(<= main_~i~0 1)} assume true; {1350#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:29,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {1350#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1350#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:29,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {1350#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1351#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:29,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {1351#(<= main_~i~0 2)} assume true; {1351#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:29,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {1351#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1351#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:29,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {1351#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1352#(<= main_~i~0 3)} is VALID [2018-11-14 19:18:29,519 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#(<= main_~i~0 3)} assume true; {1352#(<= main_~i~0 3)} is VALID [2018-11-14 19:18:29,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {1352#(<= main_~i~0 3)} assume !(~i~0 < 5); {1348#false} is VALID [2018-11-14 19:18:29,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {1348#false} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {1348#false} is VALID [2018-11-14 19:18:29,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {1348#false} is VALID [2018-11-14 19:18:29,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {1348#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1348#false} is VALID [2018-11-14 19:18:29,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {1348#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1348#false} is VALID [2018-11-14 19:18:29,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {1348#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1348#false} is VALID [2018-11-14 19:18:29,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {1348#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1348#false} is VALID [2018-11-14 19:18:29,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {1348#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1348#false} is VALID [2018-11-14 19:18:29,523 INFO L273 TraceCheckUtils]: 27: Hoare triple {1348#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1348#false} is VALID [2018-11-14 19:18:29,524 INFO L273 TraceCheckUtils]: 28: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,524 INFO L273 TraceCheckUtils]: 29: Hoare triple {1348#false} assume !(~i~0 < 5); {1348#false} is VALID [2018-11-14 19:18:29,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {1348#false} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {1348#false} is VALID [2018-11-14 19:18:29,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {1348#false} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {1348#false} is VALID [2018-11-14 19:18:29,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {1348#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {1348#false} is VALID [2018-11-14 19:18:29,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {1348#false} assume !(#t~mem7 != 0);havoc #t~mem7; {1348#false} is VALID [2018-11-14 19:18:29,525 INFO L273 TraceCheckUtils]: 35: Hoare triple {1348#false} ~nc_B~0 := 0; {1348#false} is VALID [2018-11-14 19:18:29,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,526 INFO L273 TraceCheckUtils]: 37: Hoare triple {1348#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {1348#false} is VALID [2018-11-14 19:18:29,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {1348#false} assume !!(#t~mem9 != 0);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := #t~post10 + 1;havoc #t~post10; {1348#false} is VALID [2018-11-14 19:18:29,526 INFO L273 TraceCheckUtils]: 39: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {1348#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {1348#false} is VALID [2018-11-14 19:18:29,527 INFO L273 TraceCheckUtils]: 41: Hoare triple {1348#false} assume !(#t~mem9 != 0);havoc #t~mem9; {1348#false} is VALID [2018-11-14 19:18:29,527 INFO L273 TraceCheckUtils]: 42: Hoare triple {1348#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1348#false} is VALID [2018-11-14 19:18:29,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,527 INFO L273 TraceCheckUtils]: 44: Hoare triple {1348#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1348#false} is VALID [2018-11-14 19:18:29,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {1348#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1348#false} is VALID [2018-11-14 19:18:29,528 INFO L256 TraceCheckUtils]: 46: Hoare triple {1348#false} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {1348#false} is VALID [2018-11-14 19:18:29,528 INFO L273 TraceCheckUtils]: 47: Hoare triple {1348#false} ~cond := #in~cond; {1348#false} is VALID [2018-11-14 19:18:29,528 INFO L273 TraceCheckUtils]: 48: Hoare triple {1348#false} assume ~cond == 0; {1348#false} is VALID [2018-11-14 19:18:29,528 INFO L273 TraceCheckUtils]: 49: Hoare triple {1348#false} assume !false; {1348#false} is VALID [2018-11-14 19:18:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 19:18:29,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:29,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:29,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:29,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:29,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {1347#true} call ULTIMATE.init(); {1347#true} is VALID [2018-11-14 19:18:29,725 INFO L273 TraceCheckUtils]: 1: Hoare triple {1347#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1347#true} is VALID [2018-11-14 19:18:29,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {1347#true} assume true; {1347#true} is VALID [2018-11-14 19:18:29,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1347#true} {1347#true} #112#return; {1347#true} is VALID [2018-11-14 19:18:29,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {1347#true} call #t~ret15 := main(); {1347#true} is VALID [2018-11-14 19:18:29,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {1347#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1371#(<= main_~i~0 0)} is VALID [2018-11-14 19:18:29,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {1371#(<= main_~i~0 0)} assume true; {1371#(<= main_~i~0 0)} is VALID [2018-11-14 19:18:29,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {1371#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1371#(<= main_~i~0 0)} is VALID [2018-11-14 19:18:29,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {1371#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1350#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:29,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {1350#(<= main_~i~0 1)} assume true; {1350#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:29,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {1350#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1350#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:29,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {1350#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1351#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:29,772 INFO L273 TraceCheckUtils]: 12: Hoare triple {1351#(<= main_~i~0 2)} assume true; {1351#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:29,773 INFO L273 TraceCheckUtils]: 13: Hoare triple {1351#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1351#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:29,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {1351#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1352#(<= main_~i~0 3)} is VALID [2018-11-14 19:18:29,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#(<= main_~i~0 3)} assume true; {1352#(<= main_~i~0 3)} is VALID [2018-11-14 19:18:29,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {1352#(<= main_~i~0 3)} assume !(~i~0 < 5); {1348#false} is VALID [2018-11-14 19:18:29,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {1348#false} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {1348#false} is VALID [2018-11-14 19:18:29,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {1348#false} is VALID [2018-11-14 19:18:29,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {1348#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1348#false} is VALID [2018-11-14 19:18:29,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {1348#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1348#false} is VALID [2018-11-14 19:18:29,777 INFO L273 TraceCheckUtils]: 22: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,777 INFO L273 TraceCheckUtils]: 23: Hoare triple {1348#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1348#false} is VALID [2018-11-14 19:18:29,778 INFO L273 TraceCheckUtils]: 24: Hoare triple {1348#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1348#false} is VALID [2018-11-14 19:18:29,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {1348#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1348#false} is VALID [2018-11-14 19:18:29,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {1348#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1348#false} is VALID [2018-11-14 19:18:29,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {1348#false} assume !(~i~0 < 5); {1348#false} is VALID [2018-11-14 19:18:29,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {1348#false} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {1348#false} is VALID [2018-11-14 19:18:29,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {1348#false} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {1348#false} is VALID [2018-11-14 19:18:29,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {1348#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {1348#false} is VALID [2018-11-14 19:18:29,780 INFO L273 TraceCheckUtils]: 34: Hoare triple {1348#false} assume !(#t~mem7 != 0);havoc #t~mem7; {1348#false} is VALID [2018-11-14 19:18:29,780 INFO L273 TraceCheckUtils]: 35: Hoare triple {1348#false} ~nc_B~0 := 0; {1348#false} is VALID [2018-11-14 19:18:29,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,780 INFO L273 TraceCheckUtils]: 37: Hoare triple {1348#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {1348#false} is VALID [2018-11-14 19:18:29,781 INFO L273 TraceCheckUtils]: 38: Hoare triple {1348#false} assume !!(#t~mem9 != 0);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := #t~post10 + 1;havoc #t~post10; {1348#false} is VALID [2018-11-14 19:18:29,781 INFO L273 TraceCheckUtils]: 39: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,781 INFO L273 TraceCheckUtils]: 40: Hoare triple {1348#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {1348#false} is VALID [2018-11-14 19:18:29,781 INFO L273 TraceCheckUtils]: 41: Hoare triple {1348#false} assume !(#t~mem9 != 0);havoc #t~mem9; {1348#false} is VALID [2018-11-14 19:18:29,782 INFO L273 TraceCheckUtils]: 42: Hoare triple {1348#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1348#false} is VALID [2018-11-14 19:18:29,782 INFO L273 TraceCheckUtils]: 43: Hoare triple {1348#false} assume true; {1348#false} is VALID [2018-11-14 19:18:29,782 INFO L273 TraceCheckUtils]: 44: Hoare triple {1348#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1348#false} is VALID [2018-11-14 19:18:29,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {1348#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1348#false} is VALID [2018-11-14 19:18:29,782 INFO L256 TraceCheckUtils]: 46: Hoare triple {1348#false} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {1348#false} is VALID [2018-11-14 19:18:29,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {1348#false} ~cond := #in~cond; {1348#false} is VALID [2018-11-14 19:18:29,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {1348#false} assume ~cond == 0; {1348#false} is VALID [2018-11-14 19:18:29,783 INFO L273 TraceCheckUtils]: 49: Hoare triple {1348#false} assume !false; {1348#false} is VALID [2018-11-14 19:18:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 19:18:29,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:29,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 19:18:29,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-14 19:18:29,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:29,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:18:29,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:29,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:18:29,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:18:29,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:18:29,861 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 7 states. [2018-11-14 19:18:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:30,283 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2018-11-14 19:18:30,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:18:30,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-14 19:18:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:18:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2018-11-14 19:18:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:18:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2018-11-14 19:18:30,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 120 transitions. [2018-11-14 19:18:30,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:30,569 INFO L225 Difference]: With dead ends: 115 [2018-11-14 19:18:30,570 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 19:18:30,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:18:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 19:18:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2018-11-14 19:18:30,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:30,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 58 states. [2018-11-14 19:18:30,635 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 58 states. [2018-11-14 19:18:30,636 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 58 states. [2018-11-14 19:18:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:30,639 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-11-14 19:18:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2018-11-14 19:18:30,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:30,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:30,641 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 80 states. [2018-11-14 19:18:30,641 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 80 states. [2018-11-14 19:18:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:30,645 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-11-14 19:18:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2018-11-14 19:18:30,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:30,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:30,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:30,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 19:18:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-11-14 19:18:30,648 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 50 [2018-11-14 19:18:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:30,649 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-14 19:18:30,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:18:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-11-14 19:18:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 19:18:30,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:30,651 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:30,651 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:30,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:30,652 INFO L82 PathProgramCache]: Analyzing trace with hash 56481356, now seen corresponding path program 2 times [2018-11-14 19:18:30,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:30,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:30,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:30,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:30,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:30,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2018-11-14 19:18:30,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {1894#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1894#true} is VALID [2018-11-14 19:18:30,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:30,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #112#return; {1894#true} is VALID [2018-11-14 19:18:30,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret15 := main(); {1894#true} is VALID [2018-11-14 19:18:30,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {1894#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1896#(= main_~i~0 0)} is VALID [2018-11-14 19:18:30,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {1896#(= main_~i~0 0)} assume true; {1896#(= main_~i~0 0)} is VALID [2018-11-14 19:18:30,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {1896#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1896#(= main_~i~0 0)} is VALID [2018-11-14 19:18:30,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {1896#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1897#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:30,831 INFO L273 TraceCheckUtils]: 9: Hoare triple {1897#(<= main_~i~0 1)} assume true; {1897#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:30,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {1897#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1897#(<= main_~i~0 1)} is VALID [2018-11-14 19:18:30,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {1897#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1898#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:30,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {1898#(<= main_~i~0 2)} assume true; {1898#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:30,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {1898#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1898#(<= main_~i~0 2)} is VALID [2018-11-14 19:18:30,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {1898#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1899#(<= main_~i~0 3)} is VALID [2018-11-14 19:18:30,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {1899#(<= main_~i~0 3)} assume true; {1899#(<= main_~i~0 3)} is VALID [2018-11-14 19:18:30,835 INFO L273 TraceCheckUtils]: 16: Hoare triple {1899#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1899#(<= main_~i~0 3)} is VALID [2018-11-14 19:18:30,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {1899#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1900#(<= main_~i~0 4)} is VALID [2018-11-14 19:18:30,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {1900#(<= main_~i~0 4)} assume true; {1900#(<= main_~i~0 4)} is VALID [2018-11-14 19:18:30,836 INFO L273 TraceCheckUtils]: 19: Hoare triple {1900#(<= main_~i~0 4)} assume !(~i~0 < 5); {1895#false} is VALID [2018-11-14 19:18:30,836 INFO L273 TraceCheckUtils]: 20: Hoare triple {1895#false} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {1895#false} is VALID [2018-11-14 19:18:30,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {1895#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {1895#false} is VALID [2018-11-14 19:18:30,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {1895#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1895#false} is VALID [2018-11-14 19:18:30,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {1895#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1895#false} is VALID [2018-11-14 19:18:30,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {1895#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1895#false} is VALID [2018-11-14 19:18:30,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {1895#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1895#false} is VALID [2018-11-14 19:18:30,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1895#false} is VALID [2018-11-14 19:18:30,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {1895#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1895#false} is VALID [2018-11-14 19:18:30,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {1895#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1895#false} is VALID [2018-11-14 19:18:30,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {1895#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1895#false} is VALID [2018-11-14 19:18:30,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,840 INFO L273 TraceCheckUtils]: 35: Hoare triple {1895#false} assume !(~i~0 < 5); {1895#false} is VALID [2018-11-14 19:18:30,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {1895#false} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {1895#false} is VALID [2018-11-14 19:18:30,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {1895#false} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {1895#false} is VALID [2018-11-14 19:18:30,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,841 INFO L273 TraceCheckUtils]: 39: Hoare triple {1895#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {1895#false} is VALID [2018-11-14 19:18:30,841 INFO L273 TraceCheckUtils]: 40: Hoare triple {1895#false} assume !(#t~mem7 != 0);havoc #t~mem7; {1895#false} is VALID [2018-11-14 19:18:30,841 INFO L273 TraceCheckUtils]: 41: Hoare triple {1895#false} ~nc_B~0 := 0; {1895#false} is VALID [2018-11-14 19:18:30,841 INFO L273 TraceCheckUtils]: 42: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,842 INFO L273 TraceCheckUtils]: 43: Hoare triple {1895#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {1895#false} is VALID [2018-11-14 19:18:30,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {1895#false} assume !!(#t~mem9 != 0);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := #t~post10 + 1;havoc #t~post10; {1895#false} is VALID [2018-11-14 19:18:30,842 INFO L273 TraceCheckUtils]: 45: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {1895#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {1895#false} is VALID [2018-11-14 19:18:30,842 INFO L273 TraceCheckUtils]: 47: Hoare triple {1895#false} assume !(#t~mem9 != 0);havoc #t~mem9; {1895#false} is VALID [2018-11-14 19:18:30,842 INFO L273 TraceCheckUtils]: 48: Hoare triple {1895#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1895#false} is VALID [2018-11-14 19:18:30,843 INFO L273 TraceCheckUtils]: 49: Hoare triple {1895#false} assume true; {1895#false} is VALID [2018-11-14 19:18:30,843 INFO L273 TraceCheckUtils]: 50: Hoare triple {1895#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1895#false} is VALID [2018-11-14 19:18:30,843 INFO L273 TraceCheckUtils]: 51: Hoare triple {1895#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1895#false} is VALID [2018-11-14 19:18:30,843 INFO L256 TraceCheckUtils]: 52: Hoare triple {1895#false} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {1895#false} is VALID [2018-11-14 19:18:30,843 INFO L273 TraceCheckUtils]: 53: Hoare triple {1895#false} ~cond := #in~cond; {1895#false} is VALID [2018-11-14 19:18:30,844 INFO L273 TraceCheckUtils]: 54: Hoare triple {1895#false} assume ~cond == 0; {1895#false} is VALID [2018-11-14 19:18:30,844 INFO L273 TraceCheckUtils]: 55: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2018-11-14 19:18:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-14 19:18:30,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:30,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:30,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:30,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 19:18:30,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:30,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:31,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2018-11-14 19:18:31,150 INFO L273 TraceCheckUtils]: 1: Hoare triple {1894#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1894#true} is VALID [2018-11-14 19:18:31,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #112#return; {1894#true} is VALID [2018-11-14 19:18:31,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret15 := main(); {1894#true} is VALID [2018-11-14 19:18:31,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {1894#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1894#true} is VALID [2018-11-14 19:18:31,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {1894#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1894#true} is VALID [2018-11-14 19:18:31,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {1894#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1894#true} is VALID [2018-11-14 19:18:31,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1894#true} is VALID [2018-11-14 19:18:31,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {1894#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1894#true} is VALID [2018-11-14 19:18:31,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {1894#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1894#true} is VALID [2018-11-14 19:18:31,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {1894#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1894#true} is VALID [2018-11-14 19:18:31,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {1894#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0 * 1, 1);havoc #t~nondet2; {1894#true} is VALID [2018-11-14 19:18:31,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {1894#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1894#true} is VALID [2018-11-14 19:18:31,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,154 INFO L273 TraceCheckUtils]: 19: Hoare triple {1894#true} assume !(~i~0 < 5); {1894#true} is VALID [2018-11-14 19:18:31,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {1894#true} call #t~mem3 := read~int(~#string_A~0.base, ~#string_A~0.offset + 4, 1); {1894#true} is VALID [2018-11-14 19:18:31,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {1894#true} assume !!(#t~mem3 == 0);havoc #t~mem3;~i~0 := 0; {1894#true} is VALID [2018-11-14 19:18:31,154 INFO L273 TraceCheckUtils]: 22: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,155 INFO L273 TraceCheckUtils]: 23: Hoare triple {1894#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1894#true} is VALID [2018-11-14 19:18:31,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {1894#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1894#true} is VALID [2018-11-14 19:18:31,155 INFO L273 TraceCheckUtils]: 25: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,156 INFO L273 TraceCheckUtils]: 26: Hoare triple {1894#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1894#true} is VALID [2018-11-14 19:18:31,156 INFO L273 TraceCheckUtils]: 27: Hoare triple {1894#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1894#true} is VALID [2018-11-14 19:18:31,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {1894#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1894#true} is VALID [2018-11-14 19:18:31,156 INFO L273 TraceCheckUtils]: 30: Hoare triple {1894#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1894#true} is VALID [2018-11-14 19:18:31,157 INFO L273 TraceCheckUtils]: 31: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {1894#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0 * 1, 1);havoc #t~nondet5; {1894#true} is VALID [2018-11-14 19:18:31,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {1894#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1894#true} is VALID [2018-11-14 19:18:31,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,158 INFO L273 TraceCheckUtils]: 35: Hoare triple {1894#true} assume !(~i~0 < 5); {1894#true} is VALID [2018-11-14 19:18:31,158 INFO L273 TraceCheckUtils]: 36: Hoare triple {1894#true} call #t~mem6 := read~int(~#string_B~0.base, ~#string_B~0.offset + 4, 1); {1894#true} is VALID [2018-11-14 19:18:31,158 INFO L273 TraceCheckUtils]: 37: Hoare triple {1894#true} assume !!(#t~mem6 == 0);havoc #t~mem6;~nc_A~0 := 0; {1894#true} is VALID [2018-11-14 19:18:31,158 INFO L273 TraceCheckUtils]: 38: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,159 INFO L273 TraceCheckUtils]: 39: Hoare triple {1894#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0 * 1, 1); {1894#true} is VALID [2018-11-14 19:18:31,159 INFO L273 TraceCheckUtils]: 40: Hoare triple {1894#true} assume !(#t~mem7 != 0);havoc #t~mem7; {1894#true} is VALID [2018-11-14 19:18:31,159 INFO L273 TraceCheckUtils]: 41: Hoare triple {1894#true} ~nc_B~0 := 0; {1894#true} is VALID [2018-11-14 19:18:31,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,160 INFO L273 TraceCheckUtils]: 43: Hoare triple {1894#true} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {1894#true} is VALID [2018-11-14 19:18:31,160 INFO L273 TraceCheckUtils]: 44: Hoare triple {1894#true} assume !!(#t~mem9 != 0);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := #t~post10 + 1;havoc #t~post10; {1894#true} is VALID [2018-11-14 19:18:31,160 INFO L273 TraceCheckUtils]: 45: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,160 INFO L273 TraceCheckUtils]: 46: Hoare triple {1894#true} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0 * 1, 1); {1894#true} is VALID [2018-11-14 19:18:31,161 INFO L273 TraceCheckUtils]: 47: Hoare triple {1894#true} assume !(#t~mem9 != 0);havoc #t~mem9; {1894#true} is VALID [2018-11-14 19:18:31,161 INFO L273 TraceCheckUtils]: 48: Hoare triple {1894#true} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1894#true} is VALID [2018-11-14 19:18:31,161 INFO L273 TraceCheckUtils]: 49: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-14 19:18:31,161 INFO L273 TraceCheckUtils]: 50: Hoare triple {1894#true} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1894#true} is VALID [2018-11-14 19:18:31,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {1894#true} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {2057#(or (= 0 main_~found~0) (= 1 main_~found~0))} is VALID [2018-11-14 19:18:31,182 INFO L256 TraceCheckUtils]: 52: Hoare triple {2057#(or (= 0 main_~found~0) (= 1 main_~found~0))} call __VERIFIER_assert((if ~found~0 == 0 || ~found~0 == 1 then 1 else 0)); {2061#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:18:31,184 INFO L273 TraceCheckUtils]: 53: Hoare triple {2061#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2065#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:18:31,184 INFO L273 TraceCheckUtils]: 54: Hoare triple {2065#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1895#false} is VALID [2018-11-14 19:18:31,184 INFO L273 TraceCheckUtils]: 55: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2018-11-14 19:18:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-14 19:18:31,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:18:31,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-11-14 19:18:31,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-14 19:18:31,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:31,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:18:31,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:31,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:18:31,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:18:31,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:18:31,334 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 10 states. [2018-11-14 19:18:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:32,263 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2018-11-14 19:18:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:18:32,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-14 19:18:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:18:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2018-11-14 19:18:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:18:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2018-11-14 19:18:32,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 130 transitions. [2018-11-14 19:18:32,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:32,441 INFO L225 Difference]: With dead ends: 125 [2018-11-14 19:18:32,442 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:18:32,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:18:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:18:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:18:32,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:32,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:18:32,445 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:18:32,445 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:18:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:32,445 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:18:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:18:32,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:32,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:32,446 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:18:32,446 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:18:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:32,446 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:18:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:18:32,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:32,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:32,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:32,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:18:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:18:32,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-11-14 19:18:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:32,447 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:18:32,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:18:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:18:32,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:32,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:18:32,601 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:18:32,601 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:18:32,602 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:18:32,602 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:18:32,602 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:18:32,602 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:18:32,602 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:18:32,602 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2018-11-14 19:18:32,602 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 24) no Hoare annotation was computed. [2018-11-14 19:18:32,602 INFO L425 ceAbstractionStarter]: For program point L23-3(lines 23 24) no Hoare annotation was computed. [2018-11-14 19:18:32,602 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 24) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-14 19:18:32,603 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 20) no Hoare annotation was computed. [2018-11-14 19:18:32,603 INFO L425 ceAbstractionStarter]: For program point L23-5(lines 23 24) no Hoare annotation was computed. [2018-11-14 19:18:32,603 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 20) no Hoare annotation was computed. [2018-11-14 19:18:32,603 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 20) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-14 19:18:32,603 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 20) no Hoare annotation was computed. [2018-11-14 19:18:32,603 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2018-11-14 19:18:32,603 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2018-11-14 19:18:32,603 INFO L421 ceAbstractionStarter]: At program point L32-4(lines 32 33) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-14 19:18:32,603 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2018-11-14 19:18:32,603 INFO L425 ceAbstractionStarter]: For program point L32-5(lines 15 58) no Hoare annotation was computed. [2018-11-14 19:18:32,604 INFO L425 ceAbstractionStarter]: For program point L28-2(lines 28 29) no Hoare annotation was computed. [2018-11-14 19:18:32,604 INFO L421 ceAbstractionStarter]: At program point L28-4(lines 28 29) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-14 19:18:32,604 INFO L425 ceAbstractionStarter]: For program point L28-5(lines 28 29) no Hoare annotation was computed. [2018-11-14 19:18:32,604 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-11-14 19:18:32,604 INFO L421 ceAbstractionStarter]: At program point L41-2(lines 39 51) the Hoare annotation is: (or (= 0 main_~found~0) (and (<= 0 main_~j~0) (<= main_~nc_B~0 0) (= main_~i~0 0)) (= 1 main_~found~0)) [2018-11-14 19:18:32,604 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-14 19:18:32,604 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-14 19:18:32,604 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2018-11-14 19:18:32,604 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: true [2018-11-14 19:18:32,604 INFO L421 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-14 19:18:32,604 INFO L425 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-11-14 19:18:32,605 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 51) no Hoare annotation was computed. [2018-11-14 19:18:32,605 INFO L425 ceAbstractionStarter]: For program point L39-3(lines 39 51) no Hoare annotation was computed. [2018-11-14 19:18:32,605 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-14 19:18:32,605 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-14 19:18:32,605 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-14 19:18:32,605 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-14 19:18:32,605 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-14 19:18:32,605 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-14 19:18:32,607 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: L19-5 has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 19:18:32,611 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L19-5 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 19:18:32,612 WARN L170 areAnnotationChecker]: L23-5 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L23-5 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L28-5 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-14 19:18:32,613 WARN L170 areAnnotationChecker]: L28-5 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2018-11-14 19:18:32,614 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-14 19:18:32,615 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2018-11-14 19:18:32,615 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-14 19:18:32,615 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-14 19:18:32,615 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2018-11-14 19:18:32,615 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 19:18:32,615 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 19:18:32,615 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-14 19:18:32,615 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:18:32,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:18:32 BoogieIcfgContainer [2018-11-14 19:18:32,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:18:32,628 INFO L168 Benchmark]: Toolchain (without parser) took 10173.85 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 895.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -841.9 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:32,629 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:18:32,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:32,631 INFO L168 Benchmark]: Boogie Preprocessor took 58.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:18:32,631 INFO L168 Benchmark]: RCFGBuilder took 1188.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.3 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:32,632 INFO L168 Benchmark]: TraceAbstraction took 8612.95 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.0 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -59.2 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:32,635 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1188.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.3 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8612.95 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.0 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -59.2 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 32]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (0 == found || ((0 <= j && nc_B <= 0) && i == 0)) || 1 == found - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. SAFE Result, 8.5s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 190 SDtfs, 186 SDslu, 505 SDs, 0 SdLazy, 312 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 58 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 23 PreInvPairs, 51 NumberOfFragments, 57 HoareAnnotationTreeSize, 23 FomulaSimplifications, 244 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 415 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 24547 SizeOfPredicates, 10 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 145/212 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...