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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:25:35,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:25:35,857 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:25:35,874 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:25:35,874 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:25:35,875 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:25:35,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:25:35,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:25:35,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:25:35,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:25:35,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:25:35,889 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:25:35,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:25:35,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:25:35,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:25:35,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:25:35,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:25:35,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:25:35,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:25:35,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:25:35,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:25:35,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:25:35,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:25:35,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:25:35,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:25:35,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:25:35,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:25:35,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:25:35,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:25:35,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:25:35,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:25:35,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:25:35,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:25:35,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:25:35,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:25:35,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:25:35,938 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:25:35,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:25:35,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:25:35,954 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:25:35,954 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:25:35,955 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:25:35,955 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:25:35,955 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:25:35,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:25:35,956 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:25:35,956 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:25:35,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:25:35,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:25:35,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:25:35,957 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:25:35,957 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:25:35,957 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:25:35,957 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:25:35,957 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:25:35,958 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:25:35,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:25:35,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:25:35,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:25:35,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:25:35,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:25:35,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:35,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:25:35,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:25:35,960 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:25:35,960 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:25:35,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:25:35,960 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:25:35,960 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:25:35,961 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:25:36,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:25:36,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:25:36,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:25:36,028 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:25:36,028 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:25:36,029 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-23 11:25:36,098 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3811ba741/23635be435364268bceb6a9babba637f/FLAG42a03c182 [2018-11-23 11:25:36,582 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:25:36,583 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-11-23 11:25:36,590 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3811ba741/23635be435364268bceb6a9babba637f/FLAG42a03c182 [2018-11-23 11:25:36,940 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3811ba741/23635be435364268bceb6a9babba637f [2018-11-23 11:25:36,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:25:36,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:25:36,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:36,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:25:36,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:25:36,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:36" (1/1) ... [2018-11-23 11:25:36,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b138f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:36, skipping insertion in model container [2018-11-23 11:25:36,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:36" (1/1) ... [2018-11-23 11:25:36,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:25:36,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:25:37,251 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:37,257 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:25:37,299 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:37,331 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:25:37,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37 WrapperNode [2018-11-23 11:25:37,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:37,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:37,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:25:37,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:25:37,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:37,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:25:37,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:25:37,368 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:25:37,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... [2018-11-23 11:25:37,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:25:37,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:25:37,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:25:37,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:25:37,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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-23 11:25:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:25:37,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:25:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:25:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 11:25:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:25:37,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:25:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:25:37,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:25:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:25:37,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:25:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 11:25:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:25:38,474 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:25:38,476 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:25:38,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:38 BoogieIcfgContainer [2018-11-23 11:25:38,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:25:38,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:25:38,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:25:38,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:25:38,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:25:36" (1/3) ... [2018-11-23 11:25:38,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4980d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:38, skipping insertion in model container [2018-11-23 11:25:38,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:37" (2/3) ... [2018-11-23 11:25:38,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4980d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:38, skipping insertion in model container [2018-11-23 11:25:38,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:38" (3/3) ... [2018-11-23 11:25:38,486 INFO L112 eAbstractionObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-11-23 11:25:38,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:25:38,506 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:25:38,523 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:25:38,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:25:38,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:25:38,558 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:25:38,558 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:25:38,559 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:25:38,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:25:38,559 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:25:38,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:25:38,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:25:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 11:25:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:25:38,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:38,587 INFO L402 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-23 11:25:38,590 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:38,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2018-11-23 11:25:38,601 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:38,602 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:38,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:38,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:38,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 11:25:38,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {38#true} is VALID [2018-11-23 11:25:38,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 11:25:38,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2018-11-23 11:25:38,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2018-11-23 11:25:38,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {38#true} is VALID [2018-11-23 11:25:38,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 11:25:38,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {39#false} is VALID [2018-11-23 11:25:38,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {39#false} is VALID [2018-11-23 11:25:38,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:25:38,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {39#false} is VALID [2018-11-23 11:25:38,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {39#false} is VALID [2018-11-23 11:25:38,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:25:38,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0bv32; {39#false} is VALID [2018-11-23 11:25:38,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:25:38,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {39#false} is VALID [2018-11-23 11:25:38,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:25:38,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := (if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32); {39#false} is VALID [2018-11-23 11:25:38,790 INFO L256 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {39#false} is VALID [2018-11-23 11:25:38,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2018-11-23 11:25:38,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0bv32 == ~cond; {39#false} is VALID [2018-11-23 11:25:38,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 11:25:38,795 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-23 11:25:38,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:38,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:38,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:25:38,808 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 11:25:38,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:38,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:25:38,890 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-23 11:25:38,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:25:38,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:25:38,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:38,902 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 11:25:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:39,060 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2018-11-23 11:25:39,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:25:39,060 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 11:25:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-23 11:25:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-23 11:25:39,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2018-11-23 11:25:39,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:39,383 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:25:39,383 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:25:39,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-23 11:25:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:25:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:25:39,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:39,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:25:39,557 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:25:39,557 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:25:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:39,562 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 11:25:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:25:39,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:39,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:39,564 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:25:39,564 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:25:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:39,569 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 11:25:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:25:39,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:39,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:39,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:39,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:25:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 11:25:39,576 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-11-23 11:25:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:39,576 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 11:25:39,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:25:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:25:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:25:39,578 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:39,578 INFO L402 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] [2018-11-23 11:25:39,578 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:39,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2018-11-23 11:25:39,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:39,580 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:39,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:39,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:40,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:25:40,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {279#true} is VALID [2018-11-23 11:25:40,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:25:40,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #107#return; {279#true} is VALID [2018-11-23 11:25:40,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret15 := main(); {279#true} is VALID [2018-11-23 11:25:40,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {299#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:40,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {280#false} is VALID [2018-11-23 11:25:40,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {280#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {280#false} is VALID [2018-11-23 11:25:40,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {280#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {280#false} is VALID [2018-11-23 11:25:40,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {280#false} assume !~bvslt32(~i~0, 5bv32); {280#false} is VALID [2018-11-23 11:25:40,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {280#false} is VALID [2018-11-23 11:25:40,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {280#false} is VALID [2018-11-23 11:25:40,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {280#false} is VALID [2018-11-23 11:25:40,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {280#false} is VALID [2018-11-23 11:25:40,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} ~nc_B~0 := 0bv32; {280#false} is VALID [2018-11-23 11:25:40,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {280#false} is VALID [2018-11-23 11:25:40,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {280#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {280#false} is VALID [2018-11-23 11:25:40,053 INFO L273 TraceCheckUtils]: 17: Hoare triple {280#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {280#false} is VALID [2018-11-23 11:25:40,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {280#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {280#false} is VALID [2018-11-23 11:25:40,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {280#false} ~found~0 := (if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32); {280#false} is VALID [2018-11-23 11:25:40,054 INFO L256 TraceCheckUtils]: 20: Hoare triple {280#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {280#false} is VALID [2018-11-23 11:25:40,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:25:40,055 INFO L273 TraceCheckUtils]: 22: Hoare triple {280#false} assume 0bv32 == ~cond; {280#false} is VALID [2018-11-23 11:25:40,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:25:40,058 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-23 11:25:40,059 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:40,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:40,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:25:40,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:25:40,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:40,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:25:40,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:40,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:25:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:25:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:25:40,178 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 11:25:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:40,595 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 11:25:40,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:25:40,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:25:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:25:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 11:25:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:25:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 11:25:40,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-23 11:25:40,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:40,865 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:25:40,865 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:25:40,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:25:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:25:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 11:25:40,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:40,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2018-11-23 11:25:40,910 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2018-11-23 11:25:40,911 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2018-11-23 11:25:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:40,914 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:25:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 11:25:40,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:40,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:40,915 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2018-11-23 11:25:40,916 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2018-11-23 11:25:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:40,919 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:25:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 11:25:40,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:40,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:40,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:40,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:25:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 11:25:40,923 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 11:25:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:40,923 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 11:25:40,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:25:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 11:25:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:25:40,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:40,925 INFO L402 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] [2018-11-23 11:25:40,925 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:40,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:40,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2018-11-23 11:25:40,926 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:40,926 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:40,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:40,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:41,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2018-11-23 11:25:41,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {545#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {545#true} is VALID [2018-11-23 11:25:41,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2018-11-23 11:25:41,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #107#return; {545#true} is VALID [2018-11-23 11:25:41,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret15 := main(); {545#true} is VALID [2018-11-23 11:25:41,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {545#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {565#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:41,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {565#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {565#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:41,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {565#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {572#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:41,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {572#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {546#false} is VALID [2018-11-23 11:25:41,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {546#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {546#false} is VALID [2018-11-23 11:25:41,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {546#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {546#false} is VALID [2018-11-23 11:25:41,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {546#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {546#false} is VALID [2018-11-23 11:25:41,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {546#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {546#false} is VALID [2018-11-23 11:25:41,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {546#false} assume !~bvslt32(~i~0, 5bv32); {546#false} is VALID [2018-11-23 11:25:41,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {546#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {546#false} is VALID [2018-11-23 11:25:41,168 INFO L273 TraceCheckUtils]: 15: Hoare triple {546#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {546#false} is VALID [2018-11-23 11:25:41,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {546#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {546#false} is VALID [2018-11-23 11:25:41,169 INFO L273 TraceCheckUtils]: 17: Hoare triple {546#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {546#false} is VALID [2018-11-23 11:25:41,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {546#false} ~nc_B~0 := 0bv32; {546#false} is VALID [2018-11-23 11:25:41,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {546#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {546#false} is VALID [2018-11-23 11:25:41,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {546#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {546#false} is VALID [2018-11-23 11:25:41,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {546#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {546#false} is VALID [2018-11-23 11:25:41,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {546#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {546#false} is VALID [2018-11-23 11:25:41,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {546#false} ~found~0 := (if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32); {546#false} is VALID [2018-11-23 11:25:41,171 INFO L256 TraceCheckUtils]: 24: Hoare triple {546#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {546#false} is VALID [2018-11-23 11:25:41,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {546#false} ~cond := #in~cond; {546#false} is VALID [2018-11-23 11:25:41,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {546#false} assume 0bv32 == ~cond; {546#false} is VALID [2018-11-23 11:25:41,172 INFO L273 TraceCheckUtils]: 27: Hoare triple {546#false} assume !false; {546#false} is VALID [2018-11-23 11:25:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:25:41,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:41,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {546#false} assume !false; {546#false} is VALID [2018-11-23 11:25:41,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {546#false} assume 0bv32 == ~cond; {546#false} is VALID [2018-11-23 11:25:41,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {546#false} ~cond := #in~cond; {546#false} is VALID [2018-11-23 11:25:41,290 INFO L256 TraceCheckUtils]: 24: Hoare triple {546#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {546#false} is VALID [2018-11-23 11:25:41,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {546#false} ~found~0 := (if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32); {546#false} is VALID [2018-11-23 11:25:41,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {546#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {546#false} is VALID [2018-11-23 11:25:41,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {546#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {546#false} is VALID [2018-11-23 11:25:41,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {546#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {546#false} is VALID [2018-11-23 11:25:41,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {546#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {546#false} is VALID [2018-11-23 11:25:41,292 INFO L273 TraceCheckUtils]: 18: Hoare triple {546#false} ~nc_B~0 := 0bv32; {546#false} is VALID [2018-11-23 11:25:41,292 INFO L273 TraceCheckUtils]: 17: Hoare triple {546#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {546#false} is VALID [2018-11-23 11:25:41,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {546#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {546#false} is VALID [2018-11-23 11:25:41,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {546#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {546#false} is VALID [2018-11-23 11:25:41,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {546#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {546#false} is VALID [2018-11-23 11:25:41,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {546#false} assume !~bvslt32(~i~0, 5bv32); {546#false} is VALID [2018-11-23 11:25:41,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {546#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {546#false} is VALID [2018-11-23 11:25:41,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {546#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {546#false} is VALID [2018-11-23 11:25:41,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {546#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {546#false} is VALID [2018-11-23 11:25:41,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {546#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {546#false} is VALID [2018-11-23 11:25:41,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {690#(bvslt main_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {546#false} is VALID [2018-11-23 11:25:41,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {690#(bvslt main_~i~0 (_ bv5 32))} is VALID [2018-11-23 11:25:41,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {694#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {694#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:41,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {545#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {694#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:41,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {545#true} call #t~ret15 := main(); {545#true} is VALID [2018-11-23 11:25:41,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} #107#return; {545#true} is VALID [2018-11-23 11:25:41,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {545#true} assume true; {545#true} is VALID [2018-11-23 11:25:41,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {545#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {545#true} is VALID [2018-11-23 11:25:41,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2018-11-23 11:25:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:25:41,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:41,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:25:41,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:25:41,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:41,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:25:41,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:41,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:25:41,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:25:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:25:41,383 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 6 states. [2018-11-23 11:25:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:42,004 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 11:25:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:25:42,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:25:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 11:25:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 11:25:42,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2018-11-23 11:25:42,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:42,223 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:25:42,224 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:25:42,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:25:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:25:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-11-23 11:25:42,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:42,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 42 states. [2018-11-23 11:25:42,259 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 42 states. [2018-11-23 11:25:42,259 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 42 states. [2018-11-23 11:25:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:42,264 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-23 11:25:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-23 11:25:42,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:42,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:42,265 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 58 states. [2018-11-23 11:25:42,265 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 58 states. [2018-11-23 11:25:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:42,269 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-23 11:25:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-23 11:25:42,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:42,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:42,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:42,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:25:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 11:25:42,274 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2018-11-23 11:25:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:42,274 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 11:25:42,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:25:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:25:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:25:42,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:42,276 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-23 11:25:42,276 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:42,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1655062492, now seen corresponding path program 2 times [2018-11-23 11:25:42,277 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:42,277 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:42,310 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:25:42,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:25:42,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:42,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:42,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2018-11-23 11:25:42,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {1010#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1010#true} is VALID [2018-11-23 11:25:42,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2018-11-23 11:25:42,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #107#return; {1010#true} is VALID [2018-11-23 11:25:42,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret15 := main(); {1010#true} is VALID [2018-11-23 11:25:42,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {1010#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {1010#true} is VALID [2018-11-23 11:25:42,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1010#true} is VALID [2018-11-23 11:25:42,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {1010#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1010#true} is VALID [2018-11-23 11:25:42,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1010#true} is VALID [2018-11-23 11:25:42,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {1010#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1010#true} is VALID [2018-11-23 11:25:42,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1010#true} is VALID [2018-11-23 11:25:42,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {1010#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1010#true} is VALID [2018-11-23 11:25:42,648 INFO L273 TraceCheckUtils]: 12: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1010#true} is VALID [2018-11-23 11:25:42,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {1010#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1010#true} is VALID [2018-11-23 11:25:42,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {1010#true} assume !~bvslt32(~i~0, 5bv32); {1010#true} is VALID [2018-11-23 11:25:42,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {1010#true} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {1010#true} is VALID [2018-11-23 11:25:42,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {1010#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {1010#true} is VALID [2018-11-23 11:25:42,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1010#true} is VALID [2018-11-23 11:25:42,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#true} is VALID [2018-11-23 11:25:42,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1010#true} is VALID [2018-11-23 11:25:42,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {1010#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#true} is VALID [2018-11-23 11:25:42,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1010#true} is VALID [2018-11-23 11:25:42,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {1010#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#true} is VALID [2018-11-23 11:25:42,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {1010#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1010#true} is VALID [2018-11-23 11:25:42,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {1010#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#true} is VALID [2018-11-23 11:25:42,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {1010#true} assume !~bvslt32(~i~0, 5bv32); {1010#true} is VALID [2018-11-23 11:25:42,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {1010#true} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {1010#true} is VALID [2018-11-23 11:25:42,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {1010#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {1096#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:25:42,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {1096#(= main_~nc_A~0 (_ bv0 32))} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {1096#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:25:42,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {1096#(= main_~nc_A~0 (_ bv0 32))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {1096#(= main_~nc_A~0 (_ bv0 32))} is VALID [2018-11-23 11:25:42,669 INFO L273 TraceCheckUtils]: 30: Hoare triple {1096#(= main_~nc_A~0 (_ bv0 32))} ~nc_B~0 := 0bv32; {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:42,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:42,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:42,671 INFO L273 TraceCheckUtils]: 33: Hoare triple {1106#(and (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {1116#(and (= main_~j~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:42,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {1116#(and (= main_~j~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {1116#(and (= main_~j~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:42,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {1116#(and (= main_~j~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32)))} ~found~0 := (if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32); {1123#(= (_ bv1 32) main_~found~0)} is VALID [2018-11-23 11:25:42,676 INFO L256 TraceCheckUtils]: 36: Hoare triple {1123#(= (_ bv1 32) main_~found~0)} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {1127#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:42,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {1127#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1131#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:42,679 INFO L273 TraceCheckUtils]: 38: Hoare triple {1131#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1011#false} is VALID [2018-11-23 11:25:42,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2018-11-23 11:25:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:25:42,683 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:42,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:42,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:25:42,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:25:42,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:42,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:25:42,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:42,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:25:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:25:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:25:42,806 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 8 states. [2018-11-23 11:25:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:43,446 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 11:25:43,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:25:43,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:25:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:25:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 11:25:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:25:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 11:25:43,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2018-11-23 11:25:43,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:43,579 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:25:43,580 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:25:43,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:25:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:25:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-23 11:25:43,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:43,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 47 states. [2018-11-23 11:25:43,649 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 47 states. [2018-11-23 11:25:43,649 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 47 states. [2018-11-23 11:25:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:43,652 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 11:25:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 11:25:43,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:43,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:43,653 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states. [2018-11-23 11:25:43,653 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states. [2018-11-23 11:25:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:43,655 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 11:25:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 11:25:43,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:43,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:43,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:43,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:25:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 11:25:43,659 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2018-11-23 11:25:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:43,660 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 11:25:43,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:25:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:25:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:25:43,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:43,662 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2018-11-23 11:25:43,662 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:43,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:43,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1489958921, now seen corresponding path program 1 times [2018-11-23 11:25:43,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:43,665 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:43,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:25:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:43,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:43,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {1417#true} call ULTIMATE.init(); {1417#true} is VALID [2018-11-23 11:25:43,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {1417#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1417#true} is VALID [2018-11-23 11:25:43,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2018-11-23 11:25:43,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #107#return; {1417#true} is VALID [2018-11-23 11:25:43,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {1417#true} call #t~ret15 := main(); {1417#true} is VALID [2018-11-23 11:25:43,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {1417#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {1437#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:43,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {1437#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1437#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:43,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {1437#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1444#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:43,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {1444#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1444#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:43,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {1444#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1451#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:25:43,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {1451#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1451#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:25:43,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {1451#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1458#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:43,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {1458#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1458#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:43,910 INFO L273 TraceCheckUtils]: 13: Hoare triple {1458#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1465#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:25:43,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {1465#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 5bv32); {1418#false} is VALID [2018-11-23 11:25:43,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {1418#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {1418#false} is VALID [2018-11-23 11:25:43,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {1418#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:25:43,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:25:43,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:25:43,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:25:43,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:25:43,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:25:43,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:25:43,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:25:43,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:25:43,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {1418#false} assume !~bvslt32(~i~0, 5bv32); {1418#false} is VALID [2018-11-23 11:25:43,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {1418#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {1418#false} is VALID [2018-11-23 11:25:43,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {1418#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:25:43,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {1418#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {1418#false} is VALID [2018-11-23 11:25:43,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {1418#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {1418#false} is VALID [2018-11-23 11:25:43,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {1418#false} ~nc_B~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:25:43,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {1418#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1418#false} is VALID [2018-11-23 11:25:43,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {1418#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1418#false} is VALID [2018-11-23 11:25:43,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {1418#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1418#false} is VALID [2018-11-23 11:25:43,917 INFO L273 TraceCheckUtils]: 34: Hoare triple {1418#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {1418#false} is VALID [2018-11-23 11:25:43,917 INFO L273 TraceCheckUtils]: 35: Hoare triple {1418#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {1418#false} is VALID [2018-11-23 11:25:43,917 INFO L273 TraceCheckUtils]: 36: Hoare triple {1418#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {1418#false} is VALID [2018-11-23 11:25:43,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {1418#false} ~found~0 := (if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32); {1418#false} is VALID [2018-11-23 11:25:43,918 INFO L256 TraceCheckUtils]: 38: Hoare triple {1418#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {1418#false} is VALID [2018-11-23 11:25:43,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {1418#false} ~cond := #in~cond; {1418#false} is VALID [2018-11-23 11:25:43,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {1418#false} assume 0bv32 == ~cond; {1418#false} is VALID [2018-11-23 11:25:43,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {1418#false} assume !false; {1418#false} is VALID [2018-11-23 11:25:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:25:43,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:44,123 INFO L273 TraceCheckUtils]: 41: Hoare triple {1418#false} assume !false; {1418#false} is VALID [2018-11-23 11:25:44,123 INFO L273 TraceCheckUtils]: 40: Hoare triple {1418#false} assume 0bv32 == ~cond; {1418#false} is VALID [2018-11-23 11:25:44,124 INFO L273 TraceCheckUtils]: 39: Hoare triple {1418#false} ~cond := #in~cond; {1418#false} is VALID [2018-11-23 11:25:44,124 INFO L256 TraceCheckUtils]: 38: Hoare triple {1418#false} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {1418#false} is VALID [2018-11-23 11:25:44,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {1418#false} ~found~0 := (if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32); {1418#false} is VALID [2018-11-23 11:25:44,125 INFO L273 TraceCheckUtils]: 36: Hoare triple {1418#false} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {1418#false} is VALID [2018-11-23 11:25:44,126 INFO L273 TraceCheckUtils]: 35: Hoare triple {1418#false} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {1418#false} is VALID [2018-11-23 11:25:44,126 INFO L273 TraceCheckUtils]: 34: Hoare triple {1418#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {1418#false} is VALID [2018-11-23 11:25:44,126 INFO L273 TraceCheckUtils]: 33: Hoare triple {1418#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1418#false} is VALID [2018-11-23 11:25:44,127 INFO L273 TraceCheckUtils]: 32: Hoare triple {1418#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1418#false} is VALID [2018-11-23 11:25:44,127 INFO L273 TraceCheckUtils]: 31: Hoare triple {1418#false} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {1418#false} is VALID [2018-11-23 11:25:44,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {1418#false} ~nc_B~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:25:44,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {1418#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {1418#false} is VALID [2018-11-23 11:25:44,128 INFO L273 TraceCheckUtils]: 28: Hoare triple {1418#false} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {1418#false} is VALID [2018-11-23 11:25:44,128 INFO L273 TraceCheckUtils]: 27: Hoare triple {1418#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:25:44,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {1418#false} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {1418#false} is VALID [2018-11-23 11:25:44,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {1418#false} assume !~bvslt32(~i~0, 5bv32); {1418#false} is VALID [2018-11-23 11:25:44,129 INFO L273 TraceCheckUtils]: 24: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:25:44,129 INFO L273 TraceCheckUtils]: 23: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:25:44,129 INFO L273 TraceCheckUtils]: 22: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:25:44,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:25:44,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:25:44,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:25:44,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {1418#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1418#false} is VALID [2018-11-23 11:25:44,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {1418#false} is VALID [2018-11-23 11:25:44,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {1418#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {1418#false} is VALID [2018-11-23 11:25:44,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {1418#false} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {1418#false} is VALID [2018-11-23 11:25:44,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {1631#(bvslt main_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {1418#false} is VALID [2018-11-23 11:25:44,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {1635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1631#(bvslt main_~i~0 (_ bv5 32))} is VALID [2018-11-23 11:25:44,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {1635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:44,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {1642#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:44,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {1642#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1642#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:44,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {1649#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1642#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:44,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {1649#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1649#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:44,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {1656#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1649#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:44,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {1656#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1656#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:44,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {1417#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {1656#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:44,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {1417#true} call #t~ret15 := main(); {1417#true} is VALID [2018-11-23 11:25:44,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #107#return; {1417#true} is VALID [2018-11-23 11:25:44,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2018-11-23 11:25:44,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {1417#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1417#true} is VALID [2018-11-23 11:25:44,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {1417#true} call ULTIMATE.init(); {1417#true} is VALID [2018-11-23 11:25:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:25:44,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:44,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:25:44,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 11:25:44,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:44,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:25:44,255 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-23 11:25:44,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:25:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:25:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:25:44,257 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 12 states. [2018-11-23 11:25:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:46,092 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2018-11-23 11:25:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:25:46,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 11:25:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-11-23 11:25:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-11-23 11:25:46,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2018-11-23 11:25:46,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:46,374 INFO L225 Difference]: With dead ends: 105 [2018-11-23 11:25:46,375 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:25:46,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:25:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:25:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-11-23 11:25:46,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:46,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 51 states. [2018-11-23 11:25:46,416 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 51 states. [2018-11-23 11:25:46,416 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 51 states. [2018-11-23 11:25:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:46,419 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-23 11:25:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-23 11:25:46,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:46,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:46,420 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 73 states. [2018-11-23 11:25:46,421 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 73 states. [2018-11-23 11:25:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:46,424 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-23 11:25:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-23 11:25:46,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:46,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:46,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:46,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:25:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-23 11:25:46,428 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 42 [2018-11-23 11:25:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:46,428 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-23 11:25:46,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:25:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 11:25:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:25:46,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:46,430 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2018-11-23 11:25:46,430 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:46,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1777563849, now seen corresponding path program 2 times [2018-11-23 11:25:46,431 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:46,431 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:46,455 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:25:46,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:25:46,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:46,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:46,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {2050#true} call ULTIMATE.init(); {2050#true} is VALID [2018-11-23 11:25:46,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {2050#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2050#true} is VALID [2018-11-23 11:25:46,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {2050#true} assume true; {2050#true} is VALID [2018-11-23 11:25:46,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2050#true} {2050#true} #107#return; {2050#true} is VALID [2018-11-23 11:25:46,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {2050#true} call #t~ret15 := main(); {2050#true} is VALID [2018-11-23 11:25:46,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {2050#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; {2050#true} is VALID [2018-11-23 11:25:46,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:25:46,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:25:46,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:25:46,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:25:46,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:25:46,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:25:46,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:25:46,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:25:46,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2050#true} is VALID [2018-11-23 11:25:46,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {2050#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2050#true} is VALID [2018-11-23 11:25:46,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {2050#true} assume !~bvslt32(~i~0, 5bv32); {2050#true} is VALID [2018-11-23 11:25:46,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {2050#true} call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); {2050#true} is VALID [2018-11-23 11:25:46,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {2050#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; {2050#true} is VALID [2018-11-23 11:25:46,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:25:46,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:25:46,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:25:46,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:25:46,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:25:46,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:25:46,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:25:46,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:25:46,754 INFO L273 TraceCheckUtils]: 27: Hoare triple {2050#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; {2050#true} is VALID [2018-11-23 11:25:46,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {2050#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2050#true} is VALID [2018-11-23 11:25:46,754 INFO L273 TraceCheckUtils]: 29: Hoare triple {2050#true} assume !~bvslt32(~i~0, 5bv32); {2050#true} is VALID [2018-11-23 11:25:46,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {2050#true} call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); {2050#true} is VALID [2018-11-23 11:25:46,755 INFO L273 TraceCheckUtils]: 31: Hoare triple {2050#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; {2050#true} is VALID [2018-11-23 11:25:46,755 INFO L273 TraceCheckUtils]: 32: Hoare triple {2050#true} call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); {2050#true} is VALID [2018-11-23 11:25:46,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {2050#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; {2050#true} is VALID [2018-11-23 11:25:46,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {2050#true} ~nc_B~0 := 0bv32; {2050#true} is VALID [2018-11-23 11:25:46,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {2050#true} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {2050#true} is VALID [2018-11-23 11:25:46,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {2050#true} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2050#true} is VALID [2018-11-23 11:25:46,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {2050#true} call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); {2050#true} is VALID [2018-11-23 11:25:46,756 INFO L273 TraceCheckUtils]: 38: Hoare triple {2050#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; {2050#true} is VALID [2018-11-23 11:25:46,757 INFO L273 TraceCheckUtils]: 39: Hoare triple {2050#true} assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; {2050#true} is VALID [2018-11-23 11:25:46,757 INFO L273 TraceCheckUtils]: 40: Hoare triple {2050#true} assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); {2050#true} is VALID [2018-11-23 11:25:46,758 INFO L273 TraceCheckUtils]: 41: Hoare triple {2050#true} ~found~0 := (if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32); {2178#(or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0))} is VALID [2018-11-23 11:25:46,761 INFO L256 TraceCheckUtils]: 42: Hoare triple {2178#(or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0))} call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); {2182#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:46,763 INFO L273 TraceCheckUtils]: 43: Hoare triple {2182#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2186#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:46,764 INFO L273 TraceCheckUtils]: 44: Hoare triple {2186#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2051#false} is VALID [2018-11-23 11:25:46,764 INFO L273 TraceCheckUtils]: 45: Hoare triple {2051#false} assume !false; {2051#false} is VALID [2018-11-23 11:25:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 11:25:46,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:46,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:46,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:25:46,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-23 11:25:46,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:46,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:25:46,866 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-23 11:25:46,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:25:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:25:46,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:25:46,867 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-11-23 11:25:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:47,314 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-23 11:25:47,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:25:47,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-23 11:25:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:25:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-23 11:25:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:25:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-23 11:25:47,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2018-11-23 11:25:47,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:47,388 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:25:47,389 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:25:47,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:25:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:25:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:25:47,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:47,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:47,391 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:47,391 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:47,392 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:25:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:25:47,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:47,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:47,393 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:47,393 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:47,393 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:25:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:25:47,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:47,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:47,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:47,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:25:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:25:47,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-11-23 11:25:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:47,395 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:25:47,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:25:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:25:47,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:47,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:25:47,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:25:47,735 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:25:47,735 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:25:47,735 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:25:47,735 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:25:47,735 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:25:47,736 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:25:47,736 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2018-11-23 11:25:47,736 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 24) no Hoare annotation was computed. [2018-11-23 11:25:47,736 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 23 24) the Hoare annotation is: (or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0)) [2018-11-23 11:25:47,736 INFO L448 ceAbstractionStarter]: For program point L23-4(lines 23 24) no Hoare annotation was computed. [2018-11-23 11:25:47,736 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 20) no Hoare annotation was computed. [2018-11-23 11:25:47,736 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 20) the Hoare annotation is: (or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0)) [2018-11-23 11:25:47,736 INFO L448 ceAbstractionStarter]: For program point L19-4(lines 19 20) no Hoare annotation was computed. [2018-11-23 11:25:47,737 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2018-11-23 11:25:47,737 INFO L444 ceAbstractionStarter]: At program point L32-3(lines 32 33) the Hoare annotation is: (or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0)) [2018-11-23 11:25:47,737 INFO L448 ceAbstractionStarter]: For program point L32-4(lines 15 58) no Hoare annotation was computed. [2018-11-23 11:25:47,737 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2018-11-23 11:25:47,737 INFO L444 ceAbstractionStarter]: At program point L28-3(lines 28 29) the Hoare annotation is: (or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0)) [2018-11-23 11:25:47,737 INFO L448 ceAbstractionStarter]: For program point L28-4(lines 28 29) no Hoare annotation was computed. [2018-11-23 11:25:47,738 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-11-23 11:25:47,738 INFO L444 ceAbstractionStarter]: At program point L41-2(lines 39 51) the Hoare annotation is: (or (= (_ bv0 32) main_~found~0) (and (= main_~j~0 (_ bv0 32)) (= main_~nc_A~0 (_ bv0 32)) (= main_~nc_B~0 (_ bv0 32))) (= (_ bv1 32) main_~found~0)) [2018-11-23 11:25:47,738 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-23 11:25:47,738 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 11:25:47,738 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2018-11-23 11:25:47,738 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: true [2018-11-23 11:25:47,738 INFO L444 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (or (= (_ bv0 32) main_~found~0) (= (_ bv1 32) main_~found~0)) [2018-11-23 11:25:47,738 INFO L448 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-11-23 11:25:47,738 INFO L448 ceAbstractionStarter]: For program point L39-2(lines 39 51) no Hoare annotation was computed. [2018-11-23 11:25:47,738 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 11:25:47,739 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 11:25:47,739 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 11:25:47,739 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 11:25:47,739 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 11:25:47,739 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 11:25:47,741 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:25:47,742 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-23 11:25:47,743 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 11:25:47,744 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 11:25:47,745 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 11:25:47,746 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-23 11:25:47,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:25:47 BoogieIcfgContainer [2018-11-23 11:25:47,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:25:47,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:25:47,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:25:47,760 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:25:47,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:38" (3/4) ... [2018-11-23 11:25:47,764 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:25:47,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:25:47,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:25:47,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:25:47,778 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 11:25:47,779 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 11:25:47,779 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 11:25:47,779 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:25:47,839 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:25:47,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:25:47,841 INFO L168 Benchmark]: Toolchain (without parser) took 10889.24 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 841.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:25:47,843 INFO L168 Benchmark]: CDTParser took 0.23 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-23 11:25:47,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.33 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-23 11:25:47,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.71 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-23 11:25:47,844 INFO L168 Benchmark]: Boogie Preprocessor took 51.58 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-23 11:25:47,844 INFO L168 Benchmark]: RCFGBuilder took 1057.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 699.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -732.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:25:47,845 INFO L168 Benchmark]: TraceAbstraction took 9281.83 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 141.6 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -111.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:25:47,846 INFO L168 Benchmark]: Witness Printer took 80.14 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:25:47,849 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.33 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 Procedure Inliner took 34.71 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. * Boogie Preprocessor took 51.58 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 1057.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 699.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -732.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9281.83 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 141.6 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -111.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Witness Printer took 80.14 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 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: 39]: Loop Invariant Derived loop invariant: (0bv32 == found || ((j == 0bv32 && nc_A == 0bv32) && nc_B == 0bv32)) || 1bv32 == found - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0bv32 == found || 1bv32 == found - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 0bv32 == found || 1bv32 == found - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0bv32 == found || 1bv32 == found - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0bv32 == found || 1bv32 == found - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 9.1s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 182 SDtfs, 139 SDslu, 451 SDs, 0 SdLazy, 419 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 51 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 17 PreInvPairs, 36 NumberOfFragments, 57 HoareAnnotationTreeSize, 17 FomulaSimplifications, 178 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 202 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 14752 SizeOfPredicates, 13 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 122/156 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...