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_partition_original_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:09:49,648 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:09:49,651 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:09:49,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:09:49,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:09:49,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:09:49,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:09:49,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:09:49,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:09:49,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:09:49,687 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:09:49,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:09:49,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:09:49,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:09:49,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:09:49,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:09:49,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:09:49,697 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:09:49,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:09:49,702 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:09:49,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:09:49,705 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:09:49,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:09:49,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:09:49,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:09:49,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:09:49,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:09:49,710 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:09:49,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:09:49,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:09:49,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:09:49,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:09:49,713 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:09:49,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:09:49,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:09:49,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:09:49,715 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:09:49,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:09:49,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:09:49,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:09:49,742 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:09:49,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:09:49,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:09:49,743 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:09:49,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:09:49,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:09:49,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:09:49,744 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:09:49,744 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:09:49,745 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:09:49,745 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:09:49,745 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:09:49,745 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:09:49,745 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:09:49,745 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:09:49,746 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:09:49,746 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:09:49,746 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:09:49,746 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:09:49,746 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:09:49,747 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:09:49,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:09:49,747 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:09:49,747 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:09:49,747 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:09:49,749 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:09:49,749 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:09:49,749 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:09:49,749 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:09:49,749 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:09:49,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:09:49,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:09:49,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:09:49,828 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:09:49,828 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:09:49,829 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_original_true-unreach-call_ground.i [2018-11-23 10:09:49,893 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ff9757e/38342a4969a44642bc9d4e66878d9346/FLAGbfefd6223 [2018-11-23 10:09:50,305 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:09:50,305 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_original_true-unreach-call_ground.i [2018-11-23 10:09:50,312 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ff9757e/38342a4969a44642bc9d4e66878d9346/FLAGbfefd6223 [2018-11-23 10:09:50,675 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ff9757e/38342a4969a44642bc9d4e66878d9346 [2018-11-23 10:09:50,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:09:50,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:09:50,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:09:50,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:09:50,691 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:09:50,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:09:50" (1/1) ... [2018-11-23 10:09:50,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274907e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:50, skipping insertion in model container [2018-11-23 10:09:50,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:09:50" (1/1) ... [2018-11-23 10:09:50,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:09:50,733 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:09:51,031 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:09:51,038 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:09:51,073 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:09:51,095 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:09:51,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51 WrapperNode [2018-11-23 10:09:51,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:09:51,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:09:51,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:09:51,097 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:09:51,104 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:09:51" (1/1) ... [2018-11-23 10:09:51,113 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:09:51" (1/1) ... [2018-11-23 10:09:51,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:09:51,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:09:51,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:09:51,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:09:51,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (1/1) ... [2018-11-23 10:09:51,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (1/1) ... [2018-11-23 10:09:51,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (1/1) ... [2018-11-23 10:09:51,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (1/1) ... [2018-11-23 10:09:51,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (1/1) ... [2018-11-23 10:09:51,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (1/1) ... [2018-11-23 10:09:51,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (1/1) ... [2018-11-23 10:09:51,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:09:51,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:09:51,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:09:51,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:09:51,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (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:09:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:09:51,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:09:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:09:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:09:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:09:51,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:09:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:09:51,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:09:51,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:09:51,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:09:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:09:51,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:09:51,961 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:09:51,961 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:09:51,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:09:51 BoogieIcfgContainer [2018-11-23 10:09:51,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:09:51,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:09:51,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:09:51,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:09:51,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:09:50" (1/3) ... [2018-11-23 10:09:51,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507699c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:09:51, skipping insertion in model container [2018-11-23 10:09:51,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:51" (2/3) ... [2018-11-23 10:09:51,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507699c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:09:51, skipping insertion in model container [2018-11-23 10:09:51,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:09:51" (3/3) ... [2018-11-23 10:09:51,971 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_partition_original_true-unreach-call_ground.i [2018-11-23 10:09:51,981 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:09:51,989 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:09:52,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:09:52,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:09:52,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:09:52,045 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:09:52,045 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:09:52,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:09:52,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:09:52,046 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:09:52,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:09:52,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:09:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 10:09:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:09:52,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:52,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:52,077 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:52,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash 384157332, now seen corresponding path program 1 times [2018-11-23 10:09:52,087 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:52,088 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:09:52,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:52,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:52,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 10:09:52,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-23 10:09:52,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 10:09:52,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #71#return; {33#true} is VALID [2018-11-23 10:09:52,268 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2018-11-23 10:09:52,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {33#true} is VALID [2018-11-23 10:09:52,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 10:09:52,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~x~0;~x~0 := 0bv32; {34#false} is VALID [2018-11-23 10:09:52,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {34#false} is VALID [2018-11-23 10:09:52,286 INFO L256 TraceCheckUtils]: 9: Hoare triple {34#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 10:09:52,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 10:09:52,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 10:09:52,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 10:09:52,290 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:09:52,291 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:09:52,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:09:52,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:09:52,306 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:09:52,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:52,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:09:52,508 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:09:52,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:09:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:09:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:09:52,524 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 10:09:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:52,702 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2018-11-23 10:09:52,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:09:52,702 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:09:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:09:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 10:09:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:09:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 10:09:52,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 10:09:52,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:53,010 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:09:53,010 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 10:09:53,014 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:09:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 10:09:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 10:09:53,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:53,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 10:09:53,091 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:09:53,091 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:09:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:53,097 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 10:09:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 10:09:53,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:53,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:53,099 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:09:53,099 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:09:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:53,105 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 10:09:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 10:09:53,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:53,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:53,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:53,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:09:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 10:09:53,114 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2018-11-23 10:09:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:53,114 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 10:09:53,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:09:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 10:09:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:09:53,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:53,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:53,117 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:53,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash -788448567, now seen corresponding path program 1 times [2018-11-23 10:09:53,118 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:53,118 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:09:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:53,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:53,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2018-11-23 10:09:53,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {224#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {224#true} is VALID [2018-11-23 10:09:53,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2018-11-23 10:09:53,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2018-11-23 10:09:53,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret7 := main(); {224#true} is VALID [2018-11-23 10:09:53,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {244#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:53,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {244#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {225#false} is VALID [2018-11-23 10:09:53,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {225#false} havoc ~x~0;~x~0 := 0bv32; {225#false} is VALID [2018-11-23 10:09:53,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {225#false} is VALID [2018-11-23 10:09:53,302 INFO L256 TraceCheckUtils]: 9: Hoare triple {225#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {225#false} is VALID [2018-11-23 10:09:53,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {225#false} ~cond := #in~cond; {225#false} is VALID [2018-11-23 10:09:53,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {225#false} assume 0bv32 == ~cond; {225#false} is VALID [2018-11-23 10:09:53,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {225#false} assume !false; {225#false} is VALID [2018-11-23 10:09:53,304 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:09:53,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:09:53,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:09:53,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:09:53,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:09:53,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:53,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:09:53,345 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:09:53,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:09:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:09:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:09:53,346 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-23 10:09:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:53,831 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 10:09:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:09:53,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:09:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:09:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-23 10:09:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:09:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-23 10:09:53,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2018-11-23 10:09:54,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:54,048 INFO L225 Difference]: With dead ends: 44 [2018-11-23 10:09:54,048 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:09:54,050 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:09:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:09:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 10:09:54,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:54,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 10:09:54,107 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 10:09:54,108 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 10:09:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:54,111 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 10:09:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 10:09:54,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:54,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:54,112 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 10:09:54,113 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 10:09:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:54,116 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 10:09:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 10:09:54,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:54,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:54,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:54,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:09:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 10:09:54,120 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-23 10:09:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:54,121 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 10:09:54,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:09:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:09:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:09:54,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:54,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:54,122 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:54,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:54,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2057231571, now seen corresponding path program 1 times [2018-11-23 10:09:54,123 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:54,124 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:09:54,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:54,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:54,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {418#true} call ULTIMATE.init(); {418#true} is VALID [2018-11-23 10:09:54,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {418#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {418#true} is VALID [2018-11-23 10:09:54,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {418#true} assume true; {418#true} is VALID [2018-11-23 10:09:54,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} #71#return; {418#true} is VALID [2018-11-23 10:09:54,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {418#true} call #t~ret7 := main(); {418#true} is VALID [2018-11-23 10:09:54,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {418#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {438#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:54,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {438#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {438#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:54,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {438#(= main_~a~0 (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {438#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:54,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {438#(= main_~a~0 (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {448#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:54,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {419#false} is VALID [2018-11-23 10:09:54,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {419#false} havoc ~x~0;~x~0 := 0bv32; {419#false} is VALID [2018-11-23 10:09:54,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {419#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {419#false} is VALID [2018-11-23 10:09:54,320 INFO L256 TraceCheckUtils]: 12: Hoare triple {419#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {419#false} is VALID [2018-11-23 10:09:54,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {419#false} ~cond := #in~cond; {419#false} is VALID [2018-11-23 10:09:54,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {419#false} assume 0bv32 == ~cond; {419#false} is VALID [2018-11-23 10:09:54,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {419#false} assume !false; {419#false} is VALID [2018-11-23 10:09:54,327 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:09:54,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:54,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {419#false} assume !false; {419#false} is VALID [2018-11-23 10:09:54,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {419#false} assume 0bv32 == ~cond; {419#false} is VALID [2018-11-23 10:09:54,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {419#false} ~cond := #in~cond; {419#false} is VALID [2018-11-23 10:09:54,629 INFO L256 TraceCheckUtils]: 12: Hoare triple {419#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {419#false} is VALID [2018-11-23 10:09:54,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {419#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {419#false} is VALID [2018-11-23 10:09:54,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {419#false} havoc ~x~0;~x~0 := 0bv32; {419#false} is VALID [2018-11-23 10:09:54,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {488#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {419#false} is VALID [2018-11-23 10:09:54,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {492#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {488#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:09:54,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {492#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {492#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:54,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {492#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {492#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:54,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {418#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {492#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:54,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {418#true} call #t~ret7 := main(); {418#true} is VALID [2018-11-23 10:09:54,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} #71#return; {418#true} is VALID [2018-11-23 10:09:54,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {418#true} assume true; {418#true} is VALID [2018-11-23 10:09:54,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {418#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {418#true} is VALID [2018-11-23 10:09:54,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {418#true} call ULTIMATE.init(); {418#true} is VALID [2018-11-23 10:09:54,640 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:09:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:09:54,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:09:54,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:54,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:09:54,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:54,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:09:54,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:09:54,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:09:54,715 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2018-11-23 10:09:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:55,275 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 10:09:55,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:09:55,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:09:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:09:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 10:09:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:09:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 10:09:55,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-23 10:09:55,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:55,420 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:09:55,420 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:09:55,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:09:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:09:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 10:09:55,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:55,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 10:09:55,449 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 10:09:55,449 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 10:09:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:55,453 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 10:09:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 10:09:55,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:55,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:55,454 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 10:09:55,455 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 10:09:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:55,458 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 10:09:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 10:09:55,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:55,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:55,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:55,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 10:09:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 10:09:55,462 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 16 [2018-11-23 10:09:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:55,463 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 10:09:55,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:09:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 10:09:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:09:55,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:55,464 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:55,464 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:55,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1218706871, now seen corresponding path program 2 times [2018-11-23 10:09:55,465 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:55,466 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:09:55,483 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:09:55,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:09:55,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:09:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:55,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:55,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-23 10:09:55,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {710#true} is VALID [2018-11-23 10:09:55,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-23 10:09:55,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #71#return; {710#true} is VALID [2018-11-23 10:09:55,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret7 := main(); {710#true} is VALID [2018-11-23 10:09:55,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {730#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:55,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {730#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {730#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:55,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {730#(= main_~a~0 (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {730#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:55,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {730#(= main_~a~0 (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {740#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {740#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {740#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {740#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {740#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {740#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {750#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {750#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {750#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {760#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {760#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {760#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {760#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {760#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:55,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {760#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {770#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:09:55,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {770#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {711#false} is VALID [2018-11-23 10:09:55,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#false} havoc ~x~0;~x~0 := 0bv32; {711#false} is VALID [2018-11-23 10:09:55,753 INFO L273 TraceCheckUtils]: 20: Hoare triple {711#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {711#false} is VALID [2018-11-23 10:09:55,753 INFO L256 TraceCheckUtils]: 21: Hoare triple {711#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {711#false} is VALID [2018-11-23 10:09:55,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-23 10:09:55,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} assume 0bv32 == ~cond; {711#false} is VALID [2018-11-23 10:09:55,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-23 10:09:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:55,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:55,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-23 10:09:55,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} assume 0bv32 == ~cond; {711#false} is VALID [2018-11-23 10:09:55,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-23 10:09:55,985 INFO L256 TraceCheckUtils]: 21: Hoare triple {711#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {711#false} is VALID [2018-11-23 10:09:55,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {711#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {711#false} is VALID [2018-11-23 10:09:55,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#false} havoc ~x~0;~x~0 := 0bv32; {711#false} is VALID [2018-11-23 10:09:55,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {810#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {711#false} is VALID [2018-11-23 10:09:55,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {814#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {810#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:09:55,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {814#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {814#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:55,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {814#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {814#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:55,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {824#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {814#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:55,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {824#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {824#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:55,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {824#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {824#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:56,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {834#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {824#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:56,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {834#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {834#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:56,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {834#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {834#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:56,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {844#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {834#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:56,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {844#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {844#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:56,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {844#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {844#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:56,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {844#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:56,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret7 := main(); {710#true} is VALID [2018-11-23 10:09:56,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #71#return; {710#true} is VALID [2018-11-23 10:09:56,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-23 10:09:56,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {710#true} is VALID [2018-11-23 10:09:56,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-23 10:09:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:09:56,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:56,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:09:56,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 10:09:56,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:56,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:09:56,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:56,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:09:56,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:09:56,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:09:56,129 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 12 states. [2018-11-23 10:09:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:57,601 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2018-11-23 10:09:57,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:09:57,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 10:09:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:09:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2018-11-23 10:09:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:09:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2018-11-23 10:09:57,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 90 transitions. [2018-11-23 10:09:57,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:57,796 INFO L225 Difference]: With dead ends: 69 [2018-11-23 10:09:57,796 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 10:09:57,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:09:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 10:09:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 10:09:57,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:57,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 10:09:57,837 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 10:09:57,837 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 10:09:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:57,841 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 10:09:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 10:09:57,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:57,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:57,842 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 10:09:57,842 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 10:09:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:57,846 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 10:09:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 10:09:57,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:57,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:57,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:57,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 10:09:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2018-11-23 10:09:57,851 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 25 [2018-11-23 10:09:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:57,851 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2018-11-23 10:09:57,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:09:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 10:09:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 10:09:57,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:57,853 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:57,853 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:57,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:57,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1969646199, now seen corresponding path program 3 times [2018-11-23 10:09:57,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:57,854 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:09:57,882 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:09:58,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:09:58,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:09:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:58,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:59,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 10:09:59,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {1152#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1152#true} is VALID [2018-11-23 10:09:59,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 10:09:59,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #71#return; {1152#true} is VALID [2018-11-23 10:09:59,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret7 := main(); {1152#true} is VALID [2018-11-23 10:09:59,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {1172#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:59,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {1172#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1172#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:59,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {1172#(= main_~a~0 (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1172#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:09:59,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {1172#(= main_~a~0 (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1182#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {1182#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1182#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {1182#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1182#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {1182#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1192#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {1192#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1192#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {1192#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1192#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {1192#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1202#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1202#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {1202#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1202#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {1202#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1212#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {1212#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1212#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {1212#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1212#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,246 INFO L273 TraceCheckUtils]: 20: Hoare triple {1212#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1222#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {1222#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1222#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,247 INFO L273 TraceCheckUtils]: 22: Hoare triple {1222#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1222#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,247 INFO L273 TraceCheckUtils]: 23: Hoare triple {1222#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1232#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,248 INFO L273 TraceCheckUtils]: 24: Hoare triple {1232#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1232#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,248 INFO L273 TraceCheckUtils]: 25: Hoare triple {1232#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1232#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,249 INFO L273 TraceCheckUtils]: 26: Hoare triple {1232#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1242#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,250 INFO L273 TraceCheckUtils]: 27: Hoare triple {1242#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1242#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,250 INFO L273 TraceCheckUtils]: 28: Hoare triple {1242#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1242#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {1242#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1252#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {1252#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1252#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {1252#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1252#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {1252#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1262#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {1262#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1262#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {1262#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1262#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {1262#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1272#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {1272#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {1153#false} is VALID [2018-11-23 10:09:59,258 INFO L273 TraceCheckUtils]: 37: Hoare triple {1153#false} havoc ~x~0;~x~0 := 0bv32; {1153#false} is VALID [2018-11-23 10:09:59,258 INFO L273 TraceCheckUtils]: 38: Hoare triple {1153#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1153#false} is VALID [2018-11-23 10:09:59,258 INFO L256 TraceCheckUtils]: 39: Hoare triple {1153#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {1153#false} is VALID [2018-11-23 10:09:59,259 INFO L273 TraceCheckUtils]: 40: Hoare triple {1153#false} ~cond := #in~cond; {1153#false} is VALID [2018-11-23 10:09:59,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {1153#false} assume 0bv32 == ~cond; {1153#false} is VALID [2018-11-23 10:09:59,259 INFO L273 TraceCheckUtils]: 42: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 10:09:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:59,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:59,975 INFO L273 TraceCheckUtils]: 42: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 10:09:59,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {1153#false} assume 0bv32 == ~cond; {1153#false} is VALID [2018-11-23 10:09:59,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {1153#false} ~cond := #in~cond; {1153#false} is VALID [2018-11-23 10:09:59,976 INFO L256 TraceCheckUtils]: 39: Hoare triple {1153#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {1153#false} is VALID [2018-11-23 10:09:59,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {1153#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1153#false} is VALID [2018-11-23 10:09:59,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {1153#false} havoc ~x~0;~x~0 := 0bv32; {1153#false} is VALID [2018-11-23 10:09:59,978 INFO L273 TraceCheckUtils]: 36: Hoare triple {1312#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1153#false} is VALID [2018-11-23 10:09:59,978 INFO L273 TraceCheckUtils]: 35: Hoare triple {1316#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1312#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:09:59,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {1316#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1316#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:59,979 INFO L273 TraceCheckUtils]: 33: Hoare triple {1316#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1316#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:59,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {1326#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1316#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:59,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {1326#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1326#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:59,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {1326#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1326#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:59,992 INFO L273 TraceCheckUtils]: 29: Hoare triple {1336#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1326#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:59,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {1336#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1336#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:59,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {1336#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1336#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,001 INFO L273 TraceCheckUtils]: 26: Hoare triple {1346#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1336#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,001 INFO L273 TraceCheckUtils]: 25: Hoare triple {1346#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1346#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {1346#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1346#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {1356#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1346#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,011 INFO L273 TraceCheckUtils]: 22: Hoare triple {1356#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1356#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {1356#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1356#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {1366#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1356#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1366#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1366#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {1376#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1366#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {1376#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1376#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {1376#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1376#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {1386#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1376#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {1386#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1386#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {1386#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1386#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {1396#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1386#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {1396#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1396#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {1396#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1396#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {1406#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1396#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {1406#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1406#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {1406#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1406#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,054 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {1406#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:00,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret7 := main(); {1152#true} is VALID [2018-11-23 10:10:00,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #71#return; {1152#true} is VALID [2018-11-23 10:10:00,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 10:10:00,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {1152#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1152#true} is VALID [2018-11-23 10:10:00,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 10:10:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:00,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:00,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:10:00,061 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-11-23 10:10:00,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:00,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:10:00,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:00,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:10:00,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:10:00,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:10:00,288 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 24 states. [2018-11-23 10:10:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:06,734 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2018-11-23 10:10:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:10:06,734 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-11-23 10:10:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:10:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 144 transitions. [2018-11-23 10:10:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:10:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 144 transitions. [2018-11-23 10:10:06,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 144 transitions. [2018-11-23 10:10:07,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:07,132 INFO L225 Difference]: With dead ends: 105 [2018-11-23 10:10:07,132 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 10:10:07,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:10:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 10:10:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-23 10:10:07,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:07,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2018-11-23 10:10:07,200 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2018-11-23 10:10:07,200 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2018-11-23 10:10:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:07,204 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 10:10:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 10:10:07,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:07,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:07,206 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2018-11-23 10:10:07,206 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2018-11-23 10:10:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:07,210 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 10:10:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 10:10:07,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:07,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:07,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:07,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 10:10:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2018-11-23 10:10:07,216 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 43 [2018-11-23 10:10:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:07,217 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2018-11-23 10:10:07,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:10:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 10:10:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 10:10:07,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:07,220 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:07,220 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:07,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash 712363017, now seen corresponding path program 4 times [2018-11-23 10:10:07,221 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:07,221 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:10:07,247 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:10:07,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:10:07,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:10:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:07,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:08,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2018-11-23 10:10:08,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {1894#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1894#true} is VALID [2018-11-23 10:10:08,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-23 10:10:08,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #71#return; {1894#true} is VALID [2018-11-23 10:10:08,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2018-11-23 10:10:08,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {1894#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {1914#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:10:08,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {1914#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1914#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:10:08,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {1914#(= main_~a~0 (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1914#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:10:08,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {1914#(= main_~a~0 (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1924#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {1924#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1924#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {1924#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1924#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {1924#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1934#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {1934#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1934#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {1934#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1934#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {1934#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1944#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {1944#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1944#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {1944#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1944#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {1944#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1954#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:10:08,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {1954#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1954#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:10:08,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {1954#(= (_ bv4 32) main_~a~0)} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1954#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:10:08,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {1954#(= (_ bv4 32) main_~a~0)} ~a~0 := ~bvadd32(1bv32, ~a~0); {1964#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {1964#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1964#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {1964#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1964#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {1964#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1974#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,181 INFO L273 TraceCheckUtils]: 24: Hoare triple {1974#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1974#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {1974#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1974#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {1974#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1984#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {1984#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1984#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {1984#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1984#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,193 INFO L273 TraceCheckUtils]: 29: Hoare triple {1984#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1994#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,194 INFO L273 TraceCheckUtils]: 30: Hoare triple {1994#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1994#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {1994#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1994#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,198 INFO L273 TraceCheckUtils]: 32: Hoare triple {1994#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2004#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,198 INFO L273 TraceCheckUtils]: 33: Hoare triple {2004#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2004#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {2004#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2004#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {2004#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2014#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {2014#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2014#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {2014#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2014#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {2014#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2024#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {2024#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2024#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {2024#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2024#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {2024#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2034#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,209 INFO L273 TraceCheckUtils]: 42: Hoare triple {2034#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2034#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,210 INFO L273 TraceCheckUtils]: 43: Hoare triple {2034#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2034#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,210 INFO L273 TraceCheckUtils]: 44: Hoare triple {2034#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2044#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,211 INFO L273 TraceCheckUtils]: 45: Hoare triple {2044#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2044#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,211 INFO L273 TraceCheckUtils]: 46: Hoare triple {2044#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2044#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,212 INFO L273 TraceCheckUtils]: 47: Hoare triple {2044#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2054#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,212 INFO L273 TraceCheckUtils]: 48: Hoare triple {2054#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2054#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,212 INFO L273 TraceCheckUtils]: 49: Hoare triple {2054#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2054#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {2054#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2064#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {2064#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2064#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {2064#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2064#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {2064#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2074#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,215 INFO L273 TraceCheckUtils]: 54: Hoare triple {2074#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2074#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,218 INFO L273 TraceCheckUtils]: 55: Hoare triple {2074#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2074#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,219 INFO L273 TraceCheckUtils]: 56: Hoare triple {2074#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2084#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,219 INFO L273 TraceCheckUtils]: 57: Hoare triple {2084#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2084#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,219 INFO L273 TraceCheckUtils]: 58: Hoare triple {2084#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2084#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,220 INFO L273 TraceCheckUtils]: 59: Hoare triple {2084#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2094#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,224 INFO L273 TraceCheckUtils]: 60: Hoare triple {2094#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2094#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,227 INFO L273 TraceCheckUtils]: 61: Hoare triple {2094#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2094#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,229 INFO L273 TraceCheckUtils]: 62: Hoare triple {2094#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2104#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,229 INFO L273 TraceCheckUtils]: 63: Hoare triple {2104#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2104#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {2104#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2104#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,230 INFO L273 TraceCheckUtils]: 65: Hoare triple {2104#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2114#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,231 INFO L273 TraceCheckUtils]: 66: Hoare triple {2114#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2114#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,231 INFO L273 TraceCheckUtils]: 67: Hoare triple {2114#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2114#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,232 INFO L273 TraceCheckUtils]: 68: Hoare triple {2114#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2124#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,232 INFO L273 TraceCheckUtils]: 69: Hoare triple {2124#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2124#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,233 INFO L273 TraceCheckUtils]: 70: Hoare triple {2124#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2124#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,234 INFO L273 TraceCheckUtils]: 71: Hoare triple {2124#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2134#(= (bvadd main_~a~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:08,235 INFO L273 TraceCheckUtils]: 72: Hoare triple {2134#(= (bvadd main_~a~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {1895#false} is VALID [2018-11-23 10:10:08,235 INFO L273 TraceCheckUtils]: 73: Hoare triple {1895#false} havoc ~x~0;~x~0 := 0bv32; {1895#false} is VALID [2018-11-23 10:10:08,235 INFO L273 TraceCheckUtils]: 74: Hoare triple {1895#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1895#false} is VALID [2018-11-23 10:10:08,235 INFO L256 TraceCheckUtils]: 75: Hoare triple {1895#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {1895#false} is VALID [2018-11-23 10:10:08,236 INFO L273 TraceCheckUtils]: 76: Hoare triple {1895#false} ~cond := #in~cond; {1895#false} is VALID [2018-11-23 10:10:08,236 INFO L273 TraceCheckUtils]: 77: Hoare triple {1895#false} assume 0bv32 == ~cond; {1895#false} is VALID [2018-11-23 10:10:08,236 INFO L273 TraceCheckUtils]: 78: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2018-11-23 10:10:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:08,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:10,241 INFO L273 TraceCheckUtils]: 78: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2018-11-23 10:10:10,242 INFO L273 TraceCheckUtils]: 77: Hoare triple {1895#false} assume 0bv32 == ~cond; {1895#false} is VALID [2018-11-23 10:10:10,242 INFO L273 TraceCheckUtils]: 76: Hoare triple {1895#false} ~cond := #in~cond; {1895#false} is VALID [2018-11-23 10:10:10,243 INFO L256 TraceCheckUtils]: 75: Hoare triple {1895#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {1895#false} is VALID [2018-11-23 10:10:10,243 INFO L273 TraceCheckUtils]: 74: Hoare triple {1895#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1895#false} is VALID [2018-11-23 10:10:10,243 INFO L273 TraceCheckUtils]: 73: Hoare triple {1895#false} havoc ~x~0;~x~0 := 0bv32; {1895#false} is VALID [2018-11-23 10:10:10,245 INFO L273 TraceCheckUtils]: 72: Hoare triple {2174#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1895#false} is VALID [2018-11-23 10:10:10,246 INFO L273 TraceCheckUtils]: 71: Hoare triple {2178#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2174#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:10:10,246 INFO L273 TraceCheckUtils]: 70: Hoare triple {2178#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2178#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {2178#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2178#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,252 INFO L273 TraceCheckUtils]: 68: Hoare triple {2188#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2178#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,253 INFO L273 TraceCheckUtils]: 67: Hoare triple {2188#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2188#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,253 INFO L273 TraceCheckUtils]: 66: Hoare triple {2188#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2188#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,259 INFO L273 TraceCheckUtils]: 65: Hoare triple {2198#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2188#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,259 INFO L273 TraceCheckUtils]: 64: Hoare triple {2198#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2198#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,260 INFO L273 TraceCheckUtils]: 63: Hoare triple {2198#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2198#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,267 INFO L273 TraceCheckUtils]: 62: Hoare triple {2208#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2198#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,267 INFO L273 TraceCheckUtils]: 61: Hoare triple {2208#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2208#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,268 INFO L273 TraceCheckUtils]: 60: Hoare triple {2208#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2208#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,273 INFO L273 TraceCheckUtils]: 59: Hoare triple {2218#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2208#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,275 INFO L273 TraceCheckUtils]: 58: Hoare triple {2218#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2218#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,275 INFO L273 TraceCheckUtils]: 57: Hoare triple {2218#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2218#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,281 INFO L273 TraceCheckUtils]: 56: Hoare triple {2228#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2218#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {2228#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2228#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,282 INFO L273 TraceCheckUtils]: 54: Hoare triple {2228#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2228#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,288 INFO L273 TraceCheckUtils]: 53: Hoare triple {2238#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2228#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,289 INFO L273 TraceCheckUtils]: 52: Hoare triple {2238#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2238#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,289 INFO L273 TraceCheckUtils]: 51: Hoare triple {2238#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2238#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,295 INFO L273 TraceCheckUtils]: 50: Hoare triple {2248#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2238#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,295 INFO L273 TraceCheckUtils]: 49: Hoare triple {2248#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2248#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,296 INFO L273 TraceCheckUtils]: 48: Hoare triple {2248#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2248#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2248#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,302 INFO L273 TraceCheckUtils]: 46: Hoare triple {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,303 INFO L273 TraceCheckUtils]: 45: Hoare triple {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,309 INFO L273 TraceCheckUtils]: 44: Hoare triple {2268#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {2268#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2268#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,310 INFO L273 TraceCheckUtils]: 42: Hoare triple {2268#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2268#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,316 INFO L273 TraceCheckUtils]: 41: Hoare triple {2278#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2268#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,317 INFO L273 TraceCheckUtils]: 40: Hoare triple {2278#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2278#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,317 INFO L273 TraceCheckUtils]: 39: Hoare triple {2278#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2278#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {2288#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2278#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {2288#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2288#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {2288#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2288#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,331 INFO L273 TraceCheckUtils]: 35: Hoare triple {2298#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2288#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {2298#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2298#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,333 INFO L273 TraceCheckUtils]: 33: Hoare triple {2298#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2298#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {2308#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2298#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,340 INFO L273 TraceCheckUtils]: 31: Hoare triple {2308#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2308#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {2308#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2308#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,347 INFO L273 TraceCheckUtils]: 29: Hoare triple {2318#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2308#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {2318#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2318#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {2318#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2318#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,354 INFO L273 TraceCheckUtils]: 26: Hoare triple {2328#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2318#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {2328#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2328#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {2328#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2328#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {2338#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2328#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {2338#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2338#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {2338#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2338#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {2348#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2338#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {2348#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2348#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {2348#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2348#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {2358#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2348#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {2358#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2358#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {2358#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2358#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {2368#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2358#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {2368#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2368#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {2368#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2368#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {2378#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2368#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {2378#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2378#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {2378#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2378#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {2388#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2378#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {2388#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2388#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {2388#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2388#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {1894#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {2388#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:10,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2018-11-23 10:10:10,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #71#return; {1894#true} is VALID [2018-11-23 10:10:10,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-23 10:10:10,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {1894#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1894#true} is VALID [2018-11-23 10:10:10,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2018-11-23 10:10:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:10,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:10,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:10:10,418 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2018-11-23 10:10:10,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:10,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:10:10,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:10,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:10:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:10:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:10:10,857 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand 48 states. [2018-11-23 10:10:25,249 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:10:25,820 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:10:26,408 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:10:27,296 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:10:27,925 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:10:28,583 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:10:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:36,986 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2018-11-23 10:10:36,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:10:36,986 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2018-11-23 10:10:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:10:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 252 transitions. [2018-11-23 10:10:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:10:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 252 transitions. [2018-11-23 10:10:37,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 252 transitions. [2018-11-23 10:10:37,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:37,579 INFO L225 Difference]: With dead ends: 177 [2018-11-23 10:10:37,579 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 10:10:37,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:10:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 10:10:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-11-23 10:10:37,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:37,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 161 states. [2018-11-23 10:10:37,668 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 161 states. [2018-11-23 10:10:37,668 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 161 states. [2018-11-23 10:10:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:37,675 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 10:10:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 10:10:37,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:37,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:37,676 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 161 states. [2018-11-23 10:10:37,676 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 161 states. [2018-11-23 10:10:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:37,683 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 10:10:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 10:10:37,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:37,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:37,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:37,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-23 10:10:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2018-11-23 10:10:37,690 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 79 [2018-11-23 10:10:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:37,691 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2018-11-23 10:10:37,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:10:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 10:10:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 10:10:37,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:37,696 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:37,696 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:37,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1935833353, now seen corresponding path program 5 times [2018-11-23 10:10:37,697 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:37,697 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:10:37,720 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1