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/array-examples/standard_two_index_04_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:13:35,525 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:13:35,527 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:13:35,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:13:35,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:13:35,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:13:35,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:13:35,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:13:35,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:13:35,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:13:35,546 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:13:35,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:13:35,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:13:35,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:13:35,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:13:35,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:13:35,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:13:35,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:13:35,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:13:35,556 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:13:35,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:13:35,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:13:35,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:13:35,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:13:35,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:13:35,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:13:35,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:13:35,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:13:35,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:13:35,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:13:35,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:13:35,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:13:35,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:13:35,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:13:35,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:13:35,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:13:35,570 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 10:13:35,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:13:35,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:13:35,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:13:35,586 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:13:35,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:13:35,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:13:35,587 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:13:35,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:13:35,587 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:13:35,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:13:35,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:13:35,588 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:13:35,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:13:35,588 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:13:35,588 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:13:35,589 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:13:35,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:13:35,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:13:35,589 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:13:35,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:13:35,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:13:35,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:13:35,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:13:35,590 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:13:35,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:35,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:13:35,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:13:35,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:13:35,591 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:13:35,591 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:13:35,591 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:13:35,592 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:13:35,592 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:13:35,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:13:35,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:13:35,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:13:35,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:13:35,658 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:13:35,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_04_true-unreach-call.i [2018-11-23 10:13:35,715 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be988693/15553252c70f4355adb6c98dd189ad2a/FLAGb591ef148 [2018-11-23 10:13:36,159 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:13:36,160 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_04_true-unreach-call.i [2018-11-23 10:13:36,168 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be988693/15553252c70f4355adb6c98dd189ad2a/FLAGb591ef148 [2018-11-23 10:13:36,532 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be988693/15553252c70f4355adb6c98dd189ad2a [2018-11-23 10:13:36,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:13:36,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:13:36,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:36,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:13:36,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:13:36,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50669a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36, skipping insertion in model container [2018-11-23 10:13:36,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:13:36,587 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:13:36,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:36,852 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:13:36,887 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:36,918 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:13:36,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36 WrapperNode [2018-11-23 10:13:36,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:36,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:36,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:13:36,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:13:36,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:36,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:13:36,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:13:36,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:13:36,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (1/1) ... [2018-11-23 10:13:36,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:13:36,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:13:36,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:13:36,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:13:36,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (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 10:13:37,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:13:37,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:13:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:13:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:13:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:13:37,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:13:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:13:37,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:13:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:13:37,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:13:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:13:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:13:37,636 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:13:37,636 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:13:37,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:37 BoogieIcfgContainer [2018-11-23 10:13:37,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:13:37,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:13:37,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:13:37,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:13:37,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:13:36" (1/3) ... [2018-11-23 10:13:37,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5e17e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:37, skipping insertion in model container [2018-11-23 10:13:37,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:36" (2/3) ... [2018-11-23 10:13:37,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5e17e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:37, skipping insertion in model container [2018-11-23 10:13:37,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:37" (3/3) ... [2018-11-23 10:13:37,645 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_04_true-unreach-call.i [2018-11-23 10:13:37,655 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:13:37,663 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:13:37,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:13:37,714 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:13:37,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:13:37,715 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:13:37,715 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:13:37,715 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:13:37,715 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:13:37,716 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:13:37,716 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:13:37,716 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:13:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 10:13:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:37,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:37,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:37,750 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:37,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:37,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 10:13:37,762 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:37,763 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 10:13:37,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:37,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:38,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 10:13:38,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 10:13:38,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 10:13:38,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 10:13:38,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 10:13:38,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {27#true} is VALID [2018-11-23 10:13:38,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 10:13:38,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 1bv32; {28#false} is VALID [2018-11-23 10:13:38,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !~bvslt32(~i~0, 100000bv32); {28#false} is VALID [2018-11-23 10:13:38,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 1bv32;~j~0 := 0bv32; {28#false} is VALID [2018-11-23 10:13:38,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {28#false} is VALID [2018-11-23 10:13:38,025 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 10:13:38,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 10:13:38,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 10:13:38,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 10:13:38,029 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 10:13:38,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:38,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:38,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:13:38,039 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:38,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:38,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:13:38,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:38,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:13:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:13:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:38,168 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 10:13:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:38,440 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 10:13:38,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:13:38,440 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:38,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 10:13:38,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:38,740 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:13:38,741 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:13:38,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 10:13:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:13:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:13:38,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:38,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:38,810 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:38,810 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:38,814 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:38,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:38,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:38,815 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:38,815 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:38,819 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:38,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:38,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:38,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:38,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:13:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 10:13:38,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 10:13:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:38,826 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 10:13:38,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:13:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:38,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:38,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:38,827 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:38,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:38,828 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 10:13:38,828 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:38,829 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 10:13:38,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:38,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:38,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 10:13:38,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {193#true} is VALID [2018-11-23 10:13:38,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 10:13:38,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} #60#return; {193#true} is VALID [2018-11-23 10:13:38,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {193#true} call #t~ret4 := main(); {193#true} is VALID [2018-11-23 10:13:38,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {213#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:38,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {194#false} is VALID [2018-11-23 10:13:38,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#false} ~i~0 := 1bv32; {194#false} is VALID [2018-11-23 10:13:38,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#false} assume !~bvslt32(~i~0, 100000bv32); {194#false} is VALID [2018-11-23 10:13:38,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~i~0 := 1bv32;~j~0 := 0bv32; {194#false} is VALID [2018-11-23 10:13:38,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {194#false} is VALID [2018-11-23 10:13:38,955 INFO L256 TraceCheckUtils]: 11: Hoare triple {194#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {194#false} is VALID [2018-11-23 10:13:38,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 10:13:38,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {194#false} assume 0bv32 == ~cond; {194#false} is VALID [2018-11-23 10:13:38,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 10:13:38,957 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 10:13:38,958 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:38,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:38,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:13:38,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:38,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:38,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:13:38,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:38,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:13:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:13:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:38,998 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 10:13:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:39,119 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 10:13:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:13:39,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:39,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 10:13:39,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:39,519 INFO L225 Difference]: With dead ends: 32 [2018-11-23 10:13:39,519 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:13:39,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:13:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:13:39,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:39,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:39,543 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:39,543 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:39,546 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:39,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:39,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:39,548 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:39,548 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:39,550 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:39,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:39,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:39,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:39,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:13:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:13:39,553 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 10:13:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:39,554 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:13:39,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:13:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:13:39,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:39,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:39,555 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:39,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:39,556 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2018-11-23 10:13:39,556 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:39,557 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 10:13:39,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:39,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:39,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:39,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:39,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:39,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:39,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:39,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {376#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:39,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:39,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:39,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:39,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:39,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:39,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:39,766 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:39,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:39,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:39,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:39,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:39,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:39,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:39,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:39,872 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:39,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:39,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:39,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:39,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:39,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {432#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:39,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {432#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:39,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:39,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:39,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:39,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:39,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:39,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:39,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:39,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:13:39,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:39,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:39,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:13:39,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:39,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:13:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:13:39,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:13:39,980 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 10:13:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:40,489 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 10:13:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:13:40,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:40,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 10:13:40,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:40,650 INFO L225 Difference]: With dead ends: 43 [2018-11-23 10:13:40,651 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 10:13:40,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:13:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 10:13:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-11-23 10:13:40,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:40,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:40,682 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:40,682 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:40,687 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:40,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:40,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:40,688 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:40,688 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:40,691 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:40,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:40,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:40,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:40,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:13:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 10:13:40,694 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-23 10:13:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:40,695 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 10:13:40,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:13:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 10:13:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:13:40,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:40,696 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:40,696 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:40,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -897319674, now seen corresponding path program 1 times [2018-11-23 10:13:40,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:40,698 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 10:13:40,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:40,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:40,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:40,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:40,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:40,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:40,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:40,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {647#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:40,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {647#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:40,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:40,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:40,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:40,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:40,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:40,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:40,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:40,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:40,913 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:40,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:40,914 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:40,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:40,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:40,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:40,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:41,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:41,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:41,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:41,105 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:41,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:41,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:41,106 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:41,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:41,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:41,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:41,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {727#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:41,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {727#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:41,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:41,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:41,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:41,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:41,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:41,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:41,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:41,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:41,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:41,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:41,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:13:41,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:41,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:41,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:13:41,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:41,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:13:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:13:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:13:41,183 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2018-11-23 10:13:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:42,569 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2018-11-23 10:13:42,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:13:42,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2018-11-23 10:13:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2018-11-23 10:13:42,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2018-11-23 10:13:42,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:42,710 INFO L225 Difference]: With dead ends: 53 [2018-11-23 10:13:42,710 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 10:13:42,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:13:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 10:13:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-23 10:13:42,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:42,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2018-11-23 10:13:42,742 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2018-11-23 10:13:42,742 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2018-11-23 10:13:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:42,745 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 10:13:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 10:13:42,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:42,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:42,747 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2018-11-23 10:13:42,747 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2018-11-23 10:13:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:42,750 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 10:13:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 10:13:42,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:42,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:42,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:42,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 10:13:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 10:13:42,754 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2018-11-23 10:13:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:42,754 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 10:13:42,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:13:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 10:13:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:13:42,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:42,755 INFO L402 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:42,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:42,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:42,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2083735689, now seen corresponding path program 2 times [2018-11-23 10:13:42,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:42,757 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 10:13:42,787 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:13:42,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:13:42,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:42,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:43,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {990#true} call ULTIMATE.init(); {990#true} is VALID [2018-11-23 10:13:43,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {990#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {990#true} is VALID [2018-11-23 10:13:43,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {990#true} assume true; {990#true} is VALID [2018-11-23 10:13:43,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {990#true} {990#true} #60#return; {990#true} is VALID [2018-11-23 10:13:43,143 INFO L256 TraceCheckUtils]: 4: Hoare triple {990#true} call #t~ret4 := main(); {990#true} is VALID [2018-11-23 10:13:43,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {990#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1010#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:43,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {1010#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1014#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:43,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {1014#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1018#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:43,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {1018#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1022#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:43,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {1022#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1026#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:13:43,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {1026#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1030#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:43,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {1030#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1034#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:13:43,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1038#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:43,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {1038#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1042#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:43,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {1042#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1046#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:13:43,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {1046#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1050#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:43,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {1050#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {991#false} is VALID [2018-11-23 10:13:43,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {991#false} ~i~0 := 1bv32; {991#false} is VALID [2018-11-23 10:13:43,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {991#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {991#false} is VALID [2018-11-23 10:13:43,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {991#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {991#false} is VALID [2018-11-23 10:13:43,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {991#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {991#false} is VALID [2018-11-23 10:13:43,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {991#false} assume !~bvslt32(~i~0, 100000bv32); {991#false} is VALID [2018-11-23 10:13:43,160 INFO L273 TraceCheckUtils]: 22: Hoare triple {991#false} ~i~0 := 1bv32;~j~0 := 0bv32; {991#false} is VALID [2018-11-23 10:13:43,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {991#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {991#false} is VALID [2018-11-23 10:13:43,161 INFO L256 TraceCheckUtils]: 24: Hoare triple {991#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {991#false} is VALID [2018-11-23 10:13:43,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {991#false} ~cond := #in~cond; {991#false} is VALID [2018-11-23 10:13:43,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {991#false} assume 0bv32 == ~cond; {991#false} is VALID [2018-11-23 10:13:43,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {991#false} assume !false; {991#false} is VALID [2018-11-23 10:13:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 10:13:43,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:43,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {991#false} assume !false; {991#false} is VALID [2018-11-23 10:13:43,668 INFO L273 TraceCheckUtils]: 26: Hoare triple {991#false} assume 0bv32 == ~cond; {991#false} is VALID [2018-11-23 10:13:43,668 INFO L273 TraceCheckUtils]: 25: Hoare triple {991#false} ~cond := #in~cond; {991#false} is VALID [2018-11-23 10:13:43,669 INFO L256 TraceCheckUtils]: 24: Hoare triple {991#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {991#false} is VALID [2018-11-23 10:13:43,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {991#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {991#false} is VALID [2018-11-23 10:13:43,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {991#false} ~i~0 := 1bv32;~j~0 := 0bv32; {991#false} is VALID [2018-11-23 10:13:43,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {991#false} assume !~bvslt32(~i~0, 100000bv32); {991#false} is VALID [2018-11-23 10:13:43,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {991#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {991#false} is VALID [2018-11-23 10:13:43,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {991#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {991#false} is VALID [2018-11-23 10:13:43,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {991#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {991#false} is VALID [2018-11-23 10:13:43,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {991#false} ~i~0 := 1bv32; {991#false} is VALID [2018-11-23 10:13:43,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {1120#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {991#false} is VALID [2018-11-23 10:13:43,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {1124#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1120#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:43,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {1128#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1124#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {1132#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1128#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {1136#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1132#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {1140#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1136#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {1144#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1140#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {1148#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1144#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {1152#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1148#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {1156#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1152#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {1160#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1156#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {990#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1160#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:43,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {990#true} call #t~ret4 := main(); {990#true} is VALID [2018-11-23 10:13:43,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {990#true} {990#true} #60#return; {990#true} is VALID [2018-11-23 10:13:43,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {990#true} assume true; {990#true} is VALID [2018-11-23 10:13:43,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {990#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {990#true} is VALID [2018-11-23 10:13:43,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {990#true} call ULTIMATE.init(); {990#true} is VALID [2018-11-23 10:13:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 10:13:43,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:43,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:13:43,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-11-23 10:13:43,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:43,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:13:43,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:43,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:13:43,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:13:43,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:13:43,807 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 24 states. [2018-11-23 10:13:44,883 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 7 [2018-11-23 10:13:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:48,602 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2018-11-23 10:13:48,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:13:48,602 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-11-23 10:13:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:13:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 101 transitions. [2018-11-23 10:13:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:13:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 101 transitions. [2018-11-23 10:13:48,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 101 transitions. [2018-11-23 10:13:48,833 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 10:13:48,837 INFO L225 Difference]: With dead ends: 80 [2018-11-23 10:13:48,837 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 10:13:48,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:13:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 10:13:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2018-11-23 10:13:48,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:48,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 47 states. [2018-11-23 10:13:48,898 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 47 states. [2018-11-23 10:13:48,898 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 47 states. [2018-11-23 10:13:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:48,903 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 10:13:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 10:13:48,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:48,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:48,905 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 65 states. [2018-11-23 10:13:48,905 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 65 states. [2018-11-23 10:13:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:48,909 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 10:13:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 10:13:48,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:48,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:48,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:48,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 10:13:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-23 10:13:48,914 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 28 [2018-11-23 10:13:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:48,914 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-23 10:13:48,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:13:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 10:13:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 10:13:48,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:48,916 INFO L402 BasicCegarLoop]: trace histogram [22, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:48,916 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:48,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash -151966138, now seen corresponding path program 3 times [2018-11-23 10:13:48,917 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:48,917 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 10:13:48,952 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:13:49,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 10:13:49,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:49,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:49,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {1551#true} call ULTIMATE.init(); {1551#true} is VALID [2018-11-23 10:13:49,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {1551#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1551#true} is VALID [2018-11-23 10:13:49,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {1551#true} assume true; {1551#true} is VALID [2018-11-23 10:13:49,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1551#true} {1551#true} #60#return; {1551#true} is VALID [2018-11-23 10:13:49,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {1551#true} call #t~ret4 := main(); {1551#true} is VALID [2018-11-23 10:13:49,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {1551#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1551#true} is VALID [2018-11-23 10:13:49,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,376 INFO L273 TraceCheckUtils]: 23: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {1551#true} assume !~bvslt32(~i~0, 100000bv32); {1551#true} is VALID [2018-11-23 10:13:49,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {1551#true} ~i~0 := 1bv32; {1643#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:49,379 INFO L273 TraceCheckUtils]: 30: Hoare triple {1643#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1647#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:49,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {1647#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1651#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:49,384 INFO L273 TraceCheckUtils]: 32: Hoare triple {1651#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1655#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:49,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {1655#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1659#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 10:13:49,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {1659#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1663#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:49,386 INFO L273 TraceCheckUtils]: 35: Hoare triple {1663#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1667#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-23 10:13:49,386 INFO L273 TraceCheckUtils]: 36: Hoare triple {1667#(= (_ bv25 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1552#false} is VALID [2018-11-23 10:13:49,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {1552#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1552#false} is VALID [2018-11-23 10:13:49,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {1552#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {1552#false} is VALID [2018-11-23 10:13:49,387 INFO L256 TraceCheckUtils]: 39: Hoare triple {1552#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1552#false} is VALID [2018-11-23 10:13:49,387 INFO L273 TraceCheckUtils]: 40: Hoare triple {1552#false} ~cond := #in~cond; {1552#false} is VALID [2018-11-23 10:13:49,387 INFO L273 TraceCheckUtils]: 41: Hoare triple {1552#false} assume 0bv32 == ~cond; {1552#false} is VALID [2018-11-23 10:13:49,388 INFO L273 TraceCheckUtils]: 42: Hoare triple {1552#false} assume !false; {1552#false} is VALID [2018-11-23 10:13:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 10:13:49,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:49,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {1552#false} assume !false; {1552#false} is VALID [2018-11-23 10:13:49,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {1552#false} assume 0bv32 == ~cond; {1552#false} is VALID [2018-11-23 10:13:49,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {1552#false} ~cond := #in~cond; {1552#false} is VALID [2018-11-23 10:13:49,886 INFO L256 TraceCheckUtils]: 39: Hoare triple {1552#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1552#false} is VALID [2018-11-23 10:13:49,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {1552#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {1552#false} is VALID [2018-11-23 10:13:49,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {1552#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1552#false} is VALID [2018-11-23 10:13:49,903 INFO L273 TraceCheckUtils]: 36: Hoare triple {1707#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1552#false} is VALID [2018-11-23 10:13:49,920 INFO L273 TraceCheckUtils]: 35: Hoare triple {1711#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1707#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:49,926 INFO L273 TraceCheckUtils]: 34: Hoare triple {1715#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1711#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:49,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {1719#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1715#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:49,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {1723#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1719#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:49,942 INFO L273 TraceCheckUtils]: 31: Hoare triple {1727#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1723#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:49,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {1731#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1727#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:49,949 INFO L273 TraceCheckUtils]: 29: Hoare triple {1551#true} ~i~0 := 1bv32; {1731#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:49,949 INFO L273 TraceCheckUtils]: 28: Hoare triple {1551#true} assume !~bvslt32(~i~0, 100000bv32); {1551#true} is VALID [2018-11-23 10:13:49,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {1551#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1551#true} is VALID [2018-11-23 10:13:49,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {1551#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1551#true} is VALID [2018-11-23 10:13:49,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {1551#true} call #t~ret4 := main(); {1551#true} is VALID [2018-11-23 10:13:49,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1551#true} {1551#true} #60#return; {1551#true} is VALID [2018-11-23 10:13:49,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {1551#true} assume true; {1551#true} is VALID [2018-11-23 10:13:49,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {1551#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1551#true} is VALID [2018-11-23 10:13:49,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {1551#true} call ULTIMATE.init(); {1551#true} is VALID [2018-11-23 10:13:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 10:13:49,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:49,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 10:13:49,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-11-23 10:13:49,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:49,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:13:50,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:50,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:13:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:13:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:13:50,084 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 16 states. [2018-11-23 10:13:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:53,308 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2018-11-23 10:13:53,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 10:13:53,309 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-11-23 10:13:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:13:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2018-11-23 10:13:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:13:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2018-11-23 10:13:53,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 113 transitions. [2018-11-23 10:13:53,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:53,599 INFO L225 Difference]: With dead ends: 105 [2018-11-23 10:13:53,599 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 10:13:53,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-23 10:13:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 10:13:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 55. [2018-11-23 10:13:53,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:53,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 55 states. [2018-11-23 10:13:53,661 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 55 states. [2018-11-23 10:13:53,661 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 55 states. [2018-11-23 10:13:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:53,667 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-11-23 10:13:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-11-23 10:13:53,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:53,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:53,668 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 95 states. [2018-11-23 10:13:53,669 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 95 states. [2018-11-23 10:13:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:53,673 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-11-23 10:13:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-11-23 10:13:53,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:53,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:53,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:53,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 10:13:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-23 10:13:53,677 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 43 [2018-11-23 10:13:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:53,677 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-23 10:13:53,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:13:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 10:13:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 10:13:53,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:53,678 INFO L402 BasicCegarLoop]: trace histogram [22, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:53,679 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:53,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:53,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1896931270, now seen corresponding path program 4 times [2018-11-23 10:13:53,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:53,680 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:53,698 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:13:53,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:13:53,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:53,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:54,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {2312#true} call ULTIMATE.init(); {2312#true} is VALID [2018-11-23 10:13:54,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {2312#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2312#true} is VALID [2018-11-23 10:13:54,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {2312#true} assume true; {2312#true} is VALID [2018-11-23 10:13:54,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} #60#return; {2312#true} is VALID [2018-11-23 10:13:54,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {2312#true} call #t~ret4 := main(); {2312#true} is VALID [2018-11-23 10:13:54,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {2312#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2332#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:54,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {2332#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2336#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {2336#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2340#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:13:54,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {2340#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2344#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {2344#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2348#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:13:54,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {2348#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2352#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {2352#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2356#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {2356#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2360#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {2360#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2364#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:13:54,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {2364#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2368#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {2368#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2372#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:13:54,599 INFO L273 TraceCheckUtils]: 16: Hoare triple {2372#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2376#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,601 INFO L273 TraceCheckUtils]: 17: Hoare triple {2376#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2380#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {2380#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2384#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {2384#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2388#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:13:54,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {2388#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2392#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {2392#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2396#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:13:54,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {2396#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2400#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {2400#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2404#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:13:54,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {2404#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2408#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {2408#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2412#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {2412#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2416#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-23 10:13:54,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {2416#(= (_ bv21 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2420#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:54,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2313#false} is VALID [2018-11-23 10:13:54,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {2313#false} ~i~0 := 1bv32; {2313#false} is VALID [2018-11-23 10:13:54,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,612 INFO L273 TraceCheckUtils]: 31: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,615 INFO L273 TraceCheckUtils]: 40: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,615 INFO L273 TraceCheckUtils]: 41: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,615 INFO L273 TraceCheckUtils]: 42: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:54,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {2313#false} assume !~bvslt32(~i~0, 100000bv32); {2313#false} is VALID [2018-11-23 10:13:54,615 INFO L273 TraceCheckUtils]: 45: Hoare triple {2313#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2313#false} is VALID [2018-11-23 10:13:54,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {2313#false} is VALID [2018-11-23 10:13:54,616 INFO L256 TraceCheckUtils]: 47: Hoare triple {2313#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2313#false} is VALID [2018-11-23 10:13:54,616 INFO L273 TraceCheckUtils]: 48: Hoare triple {2313#false} ~cond := #in~cond; {2313#false} is VALID [2018-11-23 10:13:54,616 INFO L273 TraceCheckUtils]: 49: Hoare triple {2313#false} assume 0bv32 == ~cond; {2313#false} is VALID [2018-11-23 10:13:54,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {2313#false} assume !false; {2313#false} is VALID [2018-11-23 10:13:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 10:13:54,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:56,543 INFO L273 TraceCheckUtils]: 50: Hoare triple {2313#false} assume !false; {2313#false} is VALID [2018-11-23 10:13:56,544 INFO L273 TraceCheckUtils]: 49: Hoare triple {2313#false} assume 0bv32 == ~cond; {2313#false} is VALID [2018-11-23 10:13:56,544 INFO L273 TraceCheckUtils]: 48: Hoare triple {2313#false} ~cond := #in~cond; {2313#false} is VALID [2018-11-23 10:13:56,544 INFO L256 TraceCheckUtils]: 47: Hoare triple {2313#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2313#false} is VALID [2018-11-23 10:13:56,544 INFO L273 TraceCheckUtils]: 46: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(4bv32, ~j~0)))), 4bv32); {2313#false} is VALID [2018-11-23 10:13:56,544 INFO L273 TraceCheckUtils]: 45: Hoare triple {2313#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2313#false} is VALID [2018-11-23 10:13:56,545 INFO L273 TraceCheckUtils]: 44: Hoare triple {2313#false} assume !~bvslt32(~i~0, 100000bv32); {2313#false} is VALID [2018-11-23 10:13:56,545 INFO L273 TraceCheckUtils]: 43: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,545 INFO L273 TraceCheckUtils]: 42: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,546 INFO L273 TraceCheckUtils]: 39: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,546 INFO L273 TraceCheckUtils]: 37: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,547 INFO L273 TraceCheckUtils]: 31: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {2313#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(4bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2313#false} is VALID [2018-11-23 10:13:56,547 INFO L273 TraceCheckUtils]: 29: Hoare triple {2313#false} ~i~0 := 1bv32; {2313#false} is VALID [2018-11-23 10:13:56,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {2556#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2313#false} is VALID [2018-11-23 10:13:56,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {2560#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2556#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:56,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {2564#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2560#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {2568#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2564#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {2572#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2568#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {2576#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2572#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {2580#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2576#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {2584#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2580#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {2588#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2584#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {2592#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2588#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {2596#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2592#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {2600#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2596#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {2604#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2600#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {2608#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2604#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {2612#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2608#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {2616#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2612#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {2620#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2616#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {2624#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2620#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {2628#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2624#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {2632#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2628#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {2636#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2632#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {2640#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2636#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {2644#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2640#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {2312#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2644#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {2312#true} call #t~ret4 := main(); {2312#true} is VALID [2018-11-23 10:13:56,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} #60#return; {2312#true} is VALID [2018-11-23 10:13:56,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {2312#true} assume true; {2312#true} is VALID [2018-11-23 10:13:56,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {2312#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2312#true} is VALID [2018-11-23 10:13:56,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {2312#true} call ULTIMATE.init(); {2312#true} is VALID [2018-11-23 10:13:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 10:13:56,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:56,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:13:56,674 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 51 [2018-11-23 10:13:56,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:56,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:13:56,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:56,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:13:56,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:13:56,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:13:56,799 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 48 states. [2018-11-23 10:14:00,447 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:14:00,895 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:14:01,405 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:14:01,919 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:14:02,486 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:14:03,008 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:14:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:17,309 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-11-23 10:14:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:14:17,310 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 51 [2018-11-23 10:14:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 164 transitions. [2018-11-23 10:14:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 164 transitions. [2018-11-23 10:14:17,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 164 transitions. [2018-11-23 10:14:17,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:17,708 INFO L225 Difference]: With dead ends: 141 [2018-11-23 10:14:17,708 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 10:14:17,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:14:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 10:14:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2018-11-23 10:14:17,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:17,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 79 states. [2018-11-23 10:14:17,930 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 79 states. [2018-11-23 10:14:17,930 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 79 states. [2018-11-23 10:14:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:17,936 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-11-23 10:14:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-11-23 10:14:17,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:17,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:17,937 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 115 states. [2018-11-23 10:14:17,938 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 115 states. [2018-11-23 10:14:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:17,943 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-11-23 10:14:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-11-23 10:14:17,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:17,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:17,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:17,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 10:14:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-23 10:14:17,946 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 51 [2018-11-23 10:14:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:17,947 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-23 10:14:17,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:14:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-23 10:14:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 10:14:17,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:17,948 INFO L402 BasicCegarLoop]: trace histogram [46, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:17,948 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:17,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash 980800966, now seen corresponding path program 5 times [2018-11-23 10:14:17,949 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:17,949 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:14:17,969 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1