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_vector_difference_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:13:51,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:13:51,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:13:51,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:13:51,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:13:51,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:13:51,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:13:51,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:13:51,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:13:51,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:13:51,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:13:51,401 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:13:51,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:13:51,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:13:51,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:13:51,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:13:51,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:13:51,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:13:51,421 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:13:51,422 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:13:51,423 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:13:51,425 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:13:51,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:13:51,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:13:51,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:13:51,428 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:13:51,429 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:13:51,430 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:13:51,431 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:13:51,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:13:51,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:13:51,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:13:51,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:13:51,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:13:51,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:13:51,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:13:51,436 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:51,465 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:13:51,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:13:51,467 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:13:51,467 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:13:51,468 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:13:51,468 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:13:51,469 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:13:51,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:13:51,469 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:13:51,469 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:13:51,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:13:51,471 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:13:51,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:13:51,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:13:51,471 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:13:51,471 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:13:51,472 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:13:51,472 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:13:51,472 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:13:51,472 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:13:51,473 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:13:51,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:13:51,474 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:13:51,474 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:13:51,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:51,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:13:51,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:13:51,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:13:51,476 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:13:51,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:13:51,476 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:13:51,476 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:13:51,476 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:13:51,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:13:51,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:13:51,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:13:51,542 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:13:51,542 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:13:51,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_vector_difference_true-unreach-call_ground.i [2018-11-23 10:13:51,616 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e22df77c/57444424978c437791d8adbd02116813/FLAG99b2c6d74 [2018-11-23 10:13:52,118 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:13:52,119 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_vector_difference_true-unreach-call_ground.i [2018-11-23 10:13:52,125 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e22df77c/57444424978c437791d8adbd02116813/FLAG99b2c6d74 [2018-11-23 10:13:52,457 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e22df77c/57444424978c437791d8adbd02116813 [2018-11-23 10:13:52,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:13:52,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:13:52,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:52,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:13:52,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:13:52,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:52" (1/1) ... [2018-11-23 10:13:52,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb77046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52, skipping insertion in model container [2018-11-23 10:13:52,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:52" (1/1) ... [2018-11-23 10:13:52,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:13:52,507 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:13:52,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:52,799 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:13:52,831 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:52,865 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:13:52,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52 WrapperNode [2018-11-23 10:13:52,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:52,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:52,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:13:52,868 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:13:52,880 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:52" (1/1) ... [2018-11-23 10:13:52,894 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:52" (1/1) ... [2018-11-23 10:13:52,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:52,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:13:52,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:13:52,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:13:52,917 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:52" (1/1) ... [2018-11-23 10:13:52,917 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:52" (1/1) ... [2018-11-23 10:13:52,920 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:52" (1/1) ... [2018-11-23 10:13:52,924 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:52" (1/1) ... [2018-11-23 10:13:52,947 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:52" (1/1) ... [2018-11-23 10:13:52,966 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:52" (1/1) ... [2018-11-23 10:13:52,968 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:52" (1/1) ... [2018-11-23 10:13:52,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:13:52,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:13:52,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:13:52,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:13:52,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (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:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:13:53,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:13:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:13:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:13:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:13:53,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:13:53,110 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:13:53,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:13:53,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:13:53,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:13:53,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:13:53,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:13:53,669 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:13:53,669 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:13:53,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:53 BoogieIcfgContainer [2018-11-23 10:13:53,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:13:53,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:13:53,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:13:53,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:13:53,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:13:52" (1/3) ... [2018-11-23 10:13:53,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e521854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:53, skipping insertion in model container [2018-11-23 10:13:53,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (2/3) ... [2018-11-23 10:13:53,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e521854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:53, skipping insertion in model container [2018-11-23 10:13:53,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:53" (3/3) ... [2018-11-23 10:13:53,678 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_vector_difference_true-unreach-call_ground.i [2018-11-23 10:13:53,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:13:53,698 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:13:53,716 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:13:53,749 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:13:53,750 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:13:53,750 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:13:53,750 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:13:53,751 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:13:53,751 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:13:53,751 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:13:53,751 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:13:53,751 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:13:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 10:13:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:13:53,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:53,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:53,782 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:53,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2018-11-23 10:13:53,793 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:53,794 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:53,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:53,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:54,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 10:13:54,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26#true} is VALID [2018-11-23 10:13:54,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 10:13:54,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #48#return; {26#true} is VALID [2018-11-23 10:13:54,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2018-11-23 10:13:54,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {26#true} is VALID [2018-11-23 10:13:54,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 10:13:54,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} havoc ~x~0;~x~0 := 0bv32; {27#false} is VALID [2018-11-23 10:13:54,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {27#false} is VALID [2018-11-23 10:13:54,045 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {27#false} is VALID [2018-11-23 10:13:54,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 10:13:54,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0bv32 == ~cond; {27#false} is VALID [2018-11-23 10:13:54,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 10:13:54,049 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:54,049 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:54,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:54,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:13:54,060 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:13:54,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:54,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:13:54,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:54,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:13:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:13:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:54,211 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 10:13:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:54,341 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 10:13:54,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:13:54,341 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:13:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 10:13:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 10:13:54,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 10:13:54,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:54,650 INFO L225 Difference]: With dead ends: 39 [2018-11-23 10:13:54,651 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 10:13:54,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 10:13:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 10:13:54,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:54,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 10:13:54,692 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 10:13:54,692 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 10:13:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:54,696 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 10:13:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:13:54,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:54,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:54,697 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 10:13:54,697 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 10:13:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:54,701 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 10:13:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:13:54,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:54,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:54,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:54,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 10:13:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 10:13:54,707 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 10:13:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:54,708 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 10:13:54,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:13:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:13:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:13:54,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:54,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:54,712 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:54,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2018-11-23 10:13:54,714 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:54,715 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:54,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:54,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:54,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {178#true} call ULTIMATE.init(); {178#true} is VALID [2018-11-23 10:13:54,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {178#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {178#true} is VALID [2018-11-23 10:13:54,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {178#true} assume true; {178#true} is VALID [2018-11-23 10:13:54,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} #48#return; {178#true} is VALID [2018-11-23 10:13:54,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {178#true} call #t~ret6 := main(); {178#true} is VALID [2018-11-23 10:13:54,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {178#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {198#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:54,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {198#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {179#false} is VALID [2018-11-23 10:13:54,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {179#false} havoc ~x~0;~x~0 := 0bv32; {179#false} is VALID [2018-11-23 10:13:54,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {179#false} is VALID [2018-11-23 10:13:54,973 INFO L256 TraceCheckUtils]: 9: Hoare triple {179#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {179#false} is VALID [2018-11-23 10:13:54,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {179#false} ~cond := #in~cond; {179#false} is VALID [2018-11-23 10:13:54,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {179#false} assume 0bv32 == ~cond; {179#false} is VALID [2018-11-23 10:13:54,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {179#false} assume !false; {179#false} is VALID [2018-11-23 10:13:54,975 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:54,975 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:54,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:54,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:13:54,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:13:54,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:54,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:13:55,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:55,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:13:55,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:13:55,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:55,007 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-23 10:13:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,146 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 10:13:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:13:55,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:13:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 10:13:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 10:13:55,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-23 10:13:55,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:55,288 INFO L225 Difference]: With dead ends: 30 [2018-11-23 10:13:55,288 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:13:55,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:13:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:13:55,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:55,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:55,398 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:55,399 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,402 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:13:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:13:55,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:55,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:55,403 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:55,404 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,407 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:13:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:13:55,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:55,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:55,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:55,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:13:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 10:13:55,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 10:13:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:55,412 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 10:13:55,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:13:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:13:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:13:55,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:55,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:55,413 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:55,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2018-11-23 10:13:55,414 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:55,415 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:55,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:55,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:55,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 10:13:55,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {327#true} is VALID [2018-11-23 10:13:55,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 10:13:55,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #48#return; {327#true} is VALID [2018-11-23 10:13:55,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret6 := main(); {327#true} is VALID [2018-11-23 10:13:55,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {347#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:55,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {347#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {351#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:55,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {328#false} is VALID [2018-11-23 10:13:55,753 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#false} havoc ~x~0;~x~0 := 0bv32; {328#false} is VALID [2018-11-23 10:13:55,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {328#false} is VALID [2018-11-23 10:13:55,754 INFO L256 TraceCheckUtils]: 10: Hoare triple {328#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {328#false} is VALID [2018-11-23 10:13:55,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 10:13:55,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 10:13:55,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 10:13:55,756 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:55,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:56,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 10:13:56,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 10:13:56,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 10:13:56,013 INFO L256 TraceCheckUtils]: 10: Hoare triple {328#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {328#false} is VALID [2018-11-23 10:13:56,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {328#false} is VALID [2018-11-23 10:13:56,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#false} havoc ~x~0;~x~0 := 0bv32; {328#false} is VALID [2018-11-23 10:13:56,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {391#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {328#false} is VALID [2018-11-23 10:13:56,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {395#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {391#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:56,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {395#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret6 := main(); {327#true} is VALID [2018-11-23 10:13:56,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #48#return; {327#true} is VALID [2018-11-23 10:13:56,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 10:13:56,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {327#true} is VALID [2018-11-23 10:13:56,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 10:13:56,021 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:56,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:56,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:13:56,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 10:13:56,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:56,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:13:56,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:56,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:13:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:13:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:13:56,144 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-11-23 10:13:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:56,536 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:13:56,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:13:56,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 10:13:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 10:13:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 10:13:56,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 10:13:56,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:56,622 INFO L225 Difference]: With dead ends: 33 [2018-11-23 10:13:56,622 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 10:13:56,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:13:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 10:13:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 10:13:56,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:56,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 10:13:56,633 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:13:56,633 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:13:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:56,636 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:13:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:13:56,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:56,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:56,638 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:13:56,638 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:13:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:56,640 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:13:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:13:56,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:56,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:56,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:56,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:13:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 10:13:56,643 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2018-11-23 10:13:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:56,643 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 10:13:56,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:13:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:13:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:13:56,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:56,645 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:56,645 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:56,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 2 times [2018-11-23 10:13:56,646 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:56,647 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:56,666 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:13:56,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:13:56,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:56,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:56,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-23 10:13:56,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {544#true} is VALID [2018-11-23 10:13:56,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-23 10:13:56,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #48#return; {544#true} is VALID [2018-11-23 10:13:56,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret6 := main(); {544#true} is VALID [2018-11-23 10:13:56,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {564#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:56,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {564#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {568#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {568#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {572#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:13:56,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {572#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {576#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {576#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {580#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:13:56,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {580#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {545#false} is VALID [2018-11-23 10:13:56,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} havoc ~x~0;~x~0 := 0bv32; {545#false} is VALID [2018-11-23 10:13:56,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {545#false} is VALID [2018-11-23 10:13:56,975 INFO L256 TraceCheckUtils]: 13: Hoare triple {545#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {545#false} is VALID [2018-11-23 10:13:56,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-23 10:13:56,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume 0bv32 == ~cond; {545#false} is VALID [2018-11-23 10:13:56,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-23 10:13:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:56,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:57,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-23 10:13:57,150 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume 0bv32 == ~cond; {545#false} is VALID [2018-11-23 10:13:57,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-23 10:13:57,151 INFO L256 TraceCheckUtils]: 13: Hoare triple {545#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {545#false} is VALID [2018-11-23 10:13:57,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {545#false} is VALID [2018-11-23 10:13:57,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} havoc ~x~0;~x~0 := 0bv32; {545#false} is VALID [2018-11-23 10:13:57,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {545#false} is VALID [2018-11-23 10:13:57,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {624#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {620#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:57,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {628#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {624#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:57,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {628#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:57,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {636#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {632#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:57,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {636#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:57,174 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret6 := main(); {544#true} is VALID [2018-11-23 10:13:57,174 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #48#return; {544#true} is VALID [2018-11-23 10:13:57,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-23 10:13:57,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {544#true} is VALID [2018-11-23 10:13:57,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-23 10:13:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:57,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:57,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:13:57,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 10:13:57,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:57,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:13:57,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:57,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:13:57,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:13:57,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:13:57,221 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-11-23 10:13:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:58,354 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 10:13:58,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:13:58,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 10:13:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 10:13:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 10:13:58,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2018-11-23 10:13:58,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:58,467 INFO L225 Difference]: With dead ends: 39 [2018-11-23 10:13:58,467 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:13:58,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 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:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:13:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 10:13:58,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:58,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 10:13:58,493 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:13:58,493 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:13:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:58,497 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 10:13:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:13:58,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:58,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:58,498 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:13:58,499 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:13:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:58,501 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 10:13:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:13:58,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:58,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:58,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:58,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:13:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 10:13:58,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2018-11-23 10:13:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:58,505 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 10:13:58,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:13:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:13:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:13:58,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:58,507 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:58,507 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:58,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 3 times [2018-11-23 10:13:58,508 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:58,508 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:58,529 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:13:58,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:13:58,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:58,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:59,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-23 10:13:59,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {827#true} is VALID [2018-11-23 10:13:59,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-23 10:13:59,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #48#return; {827#true} is VALID [2018-11-23 10:13:59,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret6 := main(); {827#true} is VALID [2018-11-23 10:13:59,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {847#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:59,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {847#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {851#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {851#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {855#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {855#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {859#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {859#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {863#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {867#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {867#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {871#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:13:59,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {871#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {875#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {875#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {879#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {879#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {883#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {883#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {887#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:13:59,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {887#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {828#false} is VALID [2018-11-23 10:13:59,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#false} havoc ~x~0;~x~0 := 0bv32; {828#false} is VALID [2018-11-23 10:13:59,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {828#false} is VALID [2018-11-23 10:13:59,350 INFO L256 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {828#false} is VALID [2018-11-23 10:13:59,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2018-11-23 10:13:59,351 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0bv32 == ~cond; {828#false} is VALID [2018-11-23 10:13:59,351 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-23 10:13:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:59,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:59,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-23 10:13:59,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0bv32 == ~cond; {828#false} is VALID [2018-11-23 10:13:59,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2018-11-23 10:13:59,783 INFO L256 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {828#false} is VALID [2018-11-23 10:13:59,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {828#false} is VALID [2018-11-23 10:13:59,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#false} havoc ~x~0;~x~0 := 0bv32; {828#false} is VALID [2018-11-23 10:13:59,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {828#false} is VALID [2018-11-23 10:13:59,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {931#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {927#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:59,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {935#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {931#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {939#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {935#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {943#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {939#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {947#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {943#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {951#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {947#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {955#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {951#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {955#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {959#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {967#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:59,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret6 := main(); {827#true} is VALID [2018-11-23 10:13:59,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #48#return; {827#true} is VALID [2018-11-23 10:13:59,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-23 10:13:59,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {827#true} is VALID [2018-11-23 10:13:59,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-23 10:13:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:59,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:59,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:13:59,869 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-23 10:13:59,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:59,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:13:59,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:59,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:13:59,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:13:59,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:13:59,949 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 24 states. [2018-11-23 10:14:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:03,703 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 10:14:03,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:14:03,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-23 10:14:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:14:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 10:14:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:14:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 10:14:03,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2018-11-23 10:14:03,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:03,885 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:14:03,885 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 10:14:03,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 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:14:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 10:14:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 10:14:03,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:03,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 10:14:03,921 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 10:14:03,922 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 10:14:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:03,924 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 10:14:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:14:03,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:03,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:03,926 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 10:14:03,926 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 10:14:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:03,929 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 10:14:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:14:03,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:03,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:03,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:03,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 10:14:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 10:14:03,933 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 23 [2018-11-23 10:14:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:03,933 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 10:14:03,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:14:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:14:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 10:14:03,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:03,935 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:03,935 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:03,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 4 times [2018-11-23 10:14:03,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:03,937 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:14:03,958 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:14:04,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:14:04,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:14:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:14:04,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:14:04,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 10:14:04,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {1242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1242#true} is VALID [2018-11-23 10:14:04,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 10:14:04,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #48#return; {1242#true} is VALID [2018-11-23 10:14:04,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret6 := main(); {1242#true} is VALID [2018-11-23 10:14:04,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1262#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:14:04,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {1262#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1266#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {1266#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,844 INFO L273 TraceCheckUtils]: 8: Hoare triple {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1274#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {1274#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1278#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {1278#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1282#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {1282#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1286#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:14:04,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {1286#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1290#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {1290#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1294#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:14:04,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {1294#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1298#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {1298#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1302#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {1302#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1306#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 10:14:04,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {1306#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1310#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {1310#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1314#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {1314#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1318#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {1318#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1322#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:14:04,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {1322#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1326#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {1326#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1330#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 10:14:04,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {1330#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1334#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,864 INFO L273 TraceCheckUtils]: 24: Hoare triple {1334#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1338#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {1338#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1342#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:14:04,870 INFO L273 TraceCheckUtils]: 26: Hoare triple {1342#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1346#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {1346#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1350#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:04,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {1350#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1243#false} is VALID [2018-11-23 10:14:04,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {1243#false} havoc ~x~0;~x~0 := 0bv32; {1243#false} is VALID [2018-11-23 10:14:04,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {1243#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1243#false} is VALID [2018-11-23 10:14:04,873 INFO L256 TraceCheckUtils]: 31: Hoare triple {1243#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {1243#false} is VALID [2018-11-23 10:14:04,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 10:14:04,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {1243#false} assume 0bv32 == ~cond; {1243#false} is VALID [2018-11-23 10:14:04,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 10:14:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:14:04,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:14:06,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 10:14:06,720 INFO L273 TraceCheckUtils]: 33: Hoare triple {1243#false} assume 0bv32 == ~cond; {1243#false} is VALID [2018-11-23 10:14:06,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 10:14:06,721 INFO L256 TraceCheckUtils]: 31: Hoare triple {1243#false} call __VERIFIER_assert((if #t~mem5 == ~bvsub32(#t~mem3, #t~mem4) then 1bv32 else 0bv32)); {1243#false} is VALID [2018-11-23 10:14:06,721 INFO L273 TraceCheckUtils]: 30: Hoare triple {1243#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1243#false} is VALID [2018-11-23 10:14:06,721 INFO L273 TraceCheckUtils]: 29: Hoare triple {1243#false} havoc ~x~0;~x~0 := 0bv32; {1243#false} is VALID [2018-11-23 10:14:06,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {1390#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1243#false} is VALID [2018-11-23 10:14:06,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1390#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:14:06,734 INFO L273 TraceCheckUtils]: 26: Hoare triple {1398#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,739 INFO L273 TraceCheckUtils]: 25: Hoare triple {1402#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1398#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {1406#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1402#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {1410#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1406#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {1414#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1410#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {1418#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1414#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {1422#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1418#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {1426#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1422#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {1430#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1426#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {1434#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1430#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {1438#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1434#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1438#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1442#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {1450#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1446#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {1454#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1450#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {1458#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1454#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1458#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {1466#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1462#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {1470#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1466#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {1474#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1470#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {1478#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvsub32(#t~mem0, #t~mem1), ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1;havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1474#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1478#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:06,863 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret6 := main(); {1242#true} is VALID [2018-11-23 10:14:06,863 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #48#return; {1242#true} is VALID [2018-11-23 10:14:06,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 10:14:06,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {1242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1242#true} is VALID [2018-11-23 10:14:06,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 10:14:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:14:06,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:14:06,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:14:06,873 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 35 [2018-11-23 10:14:06,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:14:06,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:14:07,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:07,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:14:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:14:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:14:07,034 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 48 states. [2018-11-23 10:14:15,188 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:14:15,695 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:14:16,216 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:14:16,772 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:14:17,416 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:14:17,992 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:14:18,603 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:14:19,186 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:14:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:25,462 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2018-11-23 10:14:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:14:25,462 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 35 [2018-11-23 10:14:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 100 transitions. [2018-11-23 10:14:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 100 transitions. [2018-11-23 10:14:25,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 100 transitions. [2018-11-23 10:14:25,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:25,821 INFO L225 Difference]: With dead ends: 75 [2018-11-23 10:14:25,821 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 10:14:25,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:14:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 10:14:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 10:14:25,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:25,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 10:14:25,919 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 10:14:25,919 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 10:14:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:25,922 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 10:14:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:14:25,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:25,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:25,924 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 10:14:25,925 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 10:14:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:25,927 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 10:14:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:14:25,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:25,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:25,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:25,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 10:14:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-23 10:14:25,934 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 35 [2018-11-23 10:14:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:25,934 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-23 10:14:25,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:14:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:14:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 10:14:25,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:25,936 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:25,937 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:25,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1216454706, now seen corresponding path program 5 times [2018-11-23 10:14:25,938 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:25,938 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:14:25,956 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1