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_copy6_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:29,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:29,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:30,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:30,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:30,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:30,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:30,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:30,022 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:30,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:30,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:30,024 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:30,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:30,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:30,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:30,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:30,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:30,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:30,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:30,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:30,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:30,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:30,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:30,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:30,045 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:30,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:30,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:30,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:30,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:30,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:30,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:30,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:30,053 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:30,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:30,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:30,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:30,055 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:02:30,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:30,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:30,082 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:30,082 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:30,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:30,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:30,083 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:30,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:30,087 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:30,087 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:30,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:30,087 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:30,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:30,088 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:30,088 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:30,088 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:30,088 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:30,088 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:30,090 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:30,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:30,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:30,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:30,090 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:30,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:30,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:30,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:30,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:30,091 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:30,092 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:30,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:30,092 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:30,092 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:30,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:30,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:30,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:30,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:30,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:30,162 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:30,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy6_true-unreach-call_ground.i [2018-11-23 10:02:30,218 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433db5e32/363665f0f2694112b07b09350e87f640/FLAG57b6971f4 [2018-11-23 10:02:30,667 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:30,668 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy6_true-unreach-call_ground.i [2018-11-23 10:02:30,675 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433db5e32/363665f0f2694112b07b09350e87f640/FLAG57b6971f4 [2018-11-23 10:02:31,028 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433db5e32/363665f0f2694112b07b09350e87f640 [2018-11-23 10:02:31,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:31,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:31,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:31,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:31,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:31,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506d41ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31, skipping insertion in model container [2018-11-23 10:02:31,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:31,081 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:31,316 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:31,321 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:31,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:31,384 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:31,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31 WrapperNode [2018-11-23 10:02:31,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:31,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:31,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:31,386 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:31,397 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:02:31" (1/1) ... [2018-11-23 10:02:31,409 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:02:31" (1/1) ... [2018-11-23 10:02:31,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:31,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:31,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:31,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:31,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:31,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:31,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:31,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:31,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (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:02:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:31,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:31,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:31,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:32,684 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:32,685 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 10:02:32,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:32 BoogieIcfgContainer [2018-11-23 10:02:32,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:32,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:32,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:32,689 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:32,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:31" (1/3) ... [2018-11-23 10:02:32,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3c1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:32, skipping insertion in model container [2018-11-23 10:02:32,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (2/3) ... [2018-11-23 10:02:32,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3c1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:32, skipping insertion in model container [2018-11-23 10:02:32,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:32" (3/3) ... [2018-11-23 10:02:32,693 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy6_true-unreach-call_ground.i [2018-11-23 10:02:32,703 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:32,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:32,728 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:32,759 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:32,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:32,759 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:32,760 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:32,760 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:32,760 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:32,760 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:32,760 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:32,761 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 10:02:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:02:32,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:32,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:32,787 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:32,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:32,793 INFO L82 PathProgramCache]: Analyzing trace with hash 772526198, now seen corresponding path program 1 times [2018-11-23 10:02:32,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:32,798 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:02:32,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:32,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 10:02:32,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-23 10:02:32,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 10:02:32,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #133#return; {45#true} is VALID [2018-11-23 10:02:32,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret17 := main(); {45#true} is VALID [2018-11-23 10:02:32,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {45#true} is VALID [2018-11-23 10:02:32,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 10:02:32,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} havoc ~i~0;~i~0 := 0bv32; {46#false} is VALID [2018-11-23 10:02:32,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !~bvslt32(~i~0, 100000bv32); {46#false} is VALID [2018-11-23 10:02:32,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-23 10:02:32,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !~bvslt32(~i~0, 100000bv32); {46#false} is VALID [2018-11-23 10:02:32,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-23 10:02:32,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !~bvslt32(~i~0, 100000bv32); {46#false} is VALID [2018-11-23 10:02:32,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-23 10:02:33,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume !~bvslt32(~i~0, 100000bv32); {46#false} is VALID [2018-11-23 10:02:33,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-23 10:02:33,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume !~bvslt32(~i~0, 100000bv32); {46#false} is VALID [2018-11-23 10:02:33,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-23 10:02:33,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-23 10:02:33,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} havoc ~x~0;~x~0 := 0bv32; {46#false} is VALID [2018-11-23 10:02:33,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {46#false} is VALID [2018-11-23 10:02:33,002 INFO L256 TraceCheckUtils]: 21: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {46#false} is VALID [2018-11-23 10:02:33,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-23 10:02:33,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {46#false} assume 0bv32 == ~cond; {46#false} is VALID [2018-11-23 10:02:33,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 10:02:33,008 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:02:33,008 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:33,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:33,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:33,025 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 10:02:33,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:33,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:33,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:33,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:33,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:33,136 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 10:02:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,352 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2018-11-23 10:02:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:33,353 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 10:02:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 107 transitions. [2018-11-23 10:02:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 107 transitions. [2018-11-23 10:02:33,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 107 transitions. [2018-11-23 10:02:34,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,183 INFO L225 Difference]: With dead ends: 76 [2018-11-23 10:02:34,183 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:02:34,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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:02:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:02:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 10:02:34,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:34,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:34,234 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:34,234 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,239 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 10:02:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 10:02:34,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,241 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:34,241 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,246 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 10:02:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 10:02:34,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:34,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 10:02:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 10:02:34,253 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2018-11-23 10:02:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:34,253 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 10:02:34,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 10:02:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:02:34,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:34,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:34,256 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:34,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:34,256 INFO L82 PathProgramCache]: Analyzing trace with hash 514335338, now seen corresponding path program 1 times [2018-11-23 10:02:34,257 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:34,257 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:02:34,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:34,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2018-11-23 10:02:34,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {345#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {345#true} is VALID [2018-11-23 10:02:34,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2018-11-23 10:02:34,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #133#return; {345#true} is VALID [2018-11-23 10:02:34,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret17 := main(); {345#true} is VALID [2018-11-23 10:02:34,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {345#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {365#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:34,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {365#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {346#false} is VALID [2018-11-23 10:02:34,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {346#false} havoc ~i~0;~i~0 := 0bv32; {346#false} is VALID [2018-11-23 10:02:34,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {346#false} assume !~bvslt32(~i~0, 100000bv32); {346#false} is VALID [2018-11-23 10:02:34,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {346#false} ~i~0 := 0bv32; {346#false} is VALID [2018-11-23 10:02:34,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {346#false} assume !~bvslt32(~i~0, 100000bv32); {346#false} is VALID [2018-11-23 10:02:34,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {346#false} ~i~0 := 0bv32; {346#false} is VALID [2018-11-23 10:02:34,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {346#false} assume !~bvslt32(~i~0, 100000bv32); {346#false} is VALID [2018-11-23 10:02:34,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {346#false} ~i~0 := 0bv32; {346#false} is VALID [2018-11-23 10:02:34,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {346#false} assume !~bvslt32(~i~0, 100000bv32); {346#false} is VALID [2018-11-23 10:02:34,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {346#false} ~i~0 := 0bv32; {346#false} is VALID [2018-11-23 10:02:34,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {346#false} assume !~bvslt32(~i~0, 100000bv32); {346#false} is VALID [2018-11-23 10:02:34,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {346#false} ~i~0 := 0bv32; {346#false} is VALID [2018-11-23 10:02:34,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {346#false} assume !~bvslt32(~i~0, 100000bv32); {346#false} is VALID [2018-11-23 10:02:34,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {346#false} havoc ~x~0;~x~0 := 0bv32; {346#false} is VALID [2018-11-23 10:02:34,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {346#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {346#false} is VALID [2018-11-23 10:02:34,439 INFO L256 TraceCheckUtils]: 21: Hoare triple {346#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {346#false} is VALID [2018-11-23 10:02:34,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {346#false} ~cond := #in~cond; {346#false} is VALID [2018-11-23 10:02:34,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {346#false} assume 0bv32 == ~cond; {346#false} is VALID [2018-11-23 10:02:34,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {346#false} assume !false; {346#false} is VALID [2018-11-23 10:02:34,442 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:02:34,442 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:34,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:34,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:34,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:02:34,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:34,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:34,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:34,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:34,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:34,536 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 3 states. [2018-11-23 10:02:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,866 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 10:02:34,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:34,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:02:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 10:02:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 10:02:34,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 10:02:35,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,071 INFO L225 Difference]: With dead ends: 68 [2018-11-23 10:02:35,071 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 10:02:35,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:02:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 10:02:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 10:02:35,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:35,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 10:02:35,097 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 10:02:35,097 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 10:02:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,101 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 10:02:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 10:02:35,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,103 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 10:02:35,103 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 10:02:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,106 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 10:02:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 10:02:35,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:35,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 10:02:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 10:02:35,110 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 25 [2018-11-23 10:02:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:35,111 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 10:02:35,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 10:02:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:02:35,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:35,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:35,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:35,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1148318088, now seen corresponding path program 1 times [2018-11-23 10:02:35,115 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:35,115 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:02:35,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2018-11-23 10:02:35,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {645#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {645#true} is VALID [2018-11-23 10:02:35,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2018-11-23 10:02:35,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #133#return; {645#true} is VALID [2018-11-23 10:02:35,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret17 := main(); {645#true} is VALID [2018-11-23 10:02:35,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {645#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {665#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {665#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {665#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {665#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {672#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:35,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {672#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {646#false} havoc ~i~0;~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,287 INFO L273 TraceCheckUtils]: 14: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {646#false} havoc ~x~0;~x~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {646#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {646#false} is VALID [2018-11-23 10:02:35,290 INFO L256 TraceCheckUtils]: 23: Hoare triple {646#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {646#false} is VALID [2018-11-23 10:02:35,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2018-11-23 10:02:35,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {646#false} assume 0bv32 == ~cond; {646#false} is VALID [2018-11-23 10:02:35,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {646#false} assume !false; {646#false} is VALID [2018-11-23 10:02:35,293 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:02:35,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:35,386 INFO L273 TraceCheckUtils]: 26: Hoare triple {646#false} assume !false; {646#false} is VALID [2018-11-23 10:02:35,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {646#false} assume 0bv32 == ~cond; {646#false} is VALID [2018-11-23 10:02:35,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2018-11-23 10:02:35,387 INFO L256 TraceCheckUtils]: 23: Hoare triple {646#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {646#false} is VALID [2018-11-23 10:02:35,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {646#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {646#false} is VALID [2018-11-23 10:02:35,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {646#false} havoc ~x~0;~x~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {646#false} ~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {646#false} assume !~bvslt32(~i~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {646#false} havoc ~i~0;~i~0 := 0bv32; {646#false} is VALID [2018-11-23 10:02:35,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {784#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {646#false} is VALID [2018-11-23 10:02:35,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {788#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {784#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:35,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {788#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {788#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:35,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {645#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {788#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:35,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret17 := main(); {645#true} is VALID [2018-11-23 10:02:35,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #133#return; {645#true} is VALID [2018-11-23 10:02:35,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2018-11-23 10:02:35,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {645#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {645#true} is VALID [2018-11-23 10:02:35,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2018-11-23 10:02:35,398 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:02:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:35,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 10:02:35,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:35,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:35,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:35,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:35,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:35,506 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 6 states. [2018-11-23 10:02:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,925 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-23 10:02:35,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:35,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 10:02:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-23 10:02:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-23 10:02:35,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2018-11-23 10:02:36,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,234 INFO L225 Difference]: With dead ends: 73 [2018-11-23 10:02:36,234 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 10:02:36,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 10:02:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 10:02:36,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:36,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 10:02:36,264 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 10:02:36,264 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 10:02:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,268 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 10:02:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 10:02:36,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,270 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 10:02:36,270 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 10:02:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,273 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 10:02:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 10:02:36,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:36,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 10:02:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 10:02:36,280 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 27 [2018-11-23 10:02:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:36,281 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 10:02:36,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 10:02:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 10:02:36,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:36,282 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:36,286 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:36,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:36,286 INFO L82 PathProgramCache]: Analyzing trace with hash -421330462, now seen corresponding path program 2 times [2018-11-23 10:02:36,287 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:36,287 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:02:36,318 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:36,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:36,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:36,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {1064#true} call ULTIMATE.init(); {1064#true} is VALID [2018-11-23 10:02:36,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {1064#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1064#true} is VALID [2018-11-23 10:02:36,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {1064#true} assume true; {1064#true} is VALID [2018-11-23 10:02:36,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1064#true} {1064#true} #133#return; {1064#true} is VALID [2018-11-23 10:02:36,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {1064#true} call #t~ret17 := main(); {1064#true} is VALID [2018-11-23 10:02:36,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {1064#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1064#true} is VALID [2018-11-23 10:02:36,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {1064#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1064#true} is VALID [2018-11-23 10:02:36,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {1064#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1064#true} is VALID [2018-11-23 10:02:36,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {1064#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1064#true} is VALID [2018-11-23 10:02:36,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {1064#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1064#true} is VALID [2018-11-23 10:02:36,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {1064#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1064#true} is VALID [2018-11-23 10:02:36,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {1064#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1064#true} is VALID [2018-11-23 10:02:36,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {1064#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1064#true} is VALID [2018-11-23 10:02:36,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {1064#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1064#true} is VALID [2018-11-23 10:02:36,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {1064#true} assume !~bvslt32(~a~0, 100000bv32); {1064#true} is VALID [2018-11-23 10:02:36,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {1064#true} havoc ~i~0;~i~0 := 0bv32; {1114#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1065#false} is VALID [2018-11-23 10:02:36,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {1065#false} ~i~0 := 0bv32; {1065#false} is VALID [2018-11-23 10:02:36,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {1065#false} assume !~bvslt32(~i~0, 100000bv32); {1065#false} is VALID [2018-11-23 10:02:36,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {1065#false} ~i~0 := 0bv32; {1065#false} is VALID [2018-11-23 10:02:36,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {1065#false} assume !~bvslt32(~i~0, 100000bv32); {1065#false} is VALID [2018-11-23 10:02:36,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {1065#false} ~i~0 := 0bv32; {1065#false} is VALID [2018-11-23 10:02:36,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {1065#false} assume !~bvslt32(~i~0, 100000bv32); {1065#false} is VALID [2018-11-23 10:02:36,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {1065#false} ~i~0 := 0bv32; {1065#false} is VALID [2018-11-23 10:02:36,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {1065#false} assume !~bvslt32(~i~0, 100000bv32); {1065#false} is VALID [2018-11-23 10:02:36,451 INFO L273 TraceCheckUtils]: 25: Hoare triple {1065#false} ~i~0 := 0bv32; {1065#false} is VALID [2018-11-23 10:02:36,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {1065#false} assume !~bvslt32(~i~0, 100000bv32); {1065#false} is VALID [2018-11-23 10:02:36,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {1065#false} havoc ~x~0;~x~0 := 0bv32; {1065#false} is VALID [2018-11-23 10:02:36,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {1065#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1065#false} is VALID [2018-11-23 10:02:36,452 INFO L256 TraceCheckUtils]: 29: Hoare triple {1065#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {1065#false} is VALID [2018-11-23 10:02:36,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {1065#false} ~cond := #in~cond; {1065#false} is VALID [2018-11-23 10:02:36,452 INFO L273 TraceCheckUtils]: 31: Hoare triple {1065#false} assume 0bv32 == ~cond; {1065#false} is VALID [2018-11-23 10:02:36,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {1065#false} assume !false; {1065#false} is VALID [2018-11-23 10:02:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 10:02:36,455 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:36,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:36,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:36,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 10:02:36,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:36,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:36,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:36,549 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-23 10:02:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,866 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2018-11-23 10:02:36,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:36,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 10:02:36,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 10:02:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 10:02:36,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-23 10:02:37,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,018 INFO L225 Difference]: With dead ends: 82 [2018-11-23 10:02:37,018 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 10:02:37,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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:02:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 10:02:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-11-23 10:02:37,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:37,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 50 states. [2018-11-23 10:02:37,079 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 50 states. [2018-11-23 10:02:37,079 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 50 states. [2018-11-23 10:02:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,083 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 10:02:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-23 10:02:37,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,084 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 56 states. [2018-11-23 10:02:37,085 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 56 states. [2018-11-23 10:02:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,090 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 10:02:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-23 10:02:37,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:37,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:02:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 10:02:37,097 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2018-11-23 10:02:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:37,098 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 10:02:37,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 10:02:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 10:02:37,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:37,101 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:37,101 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:37,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1613227306, now seen corresponding path program 1 times [2018-11-23 10:02:37,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:37,107 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:02:37,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:37,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {1465#true} call ULTIMATE.init(); {1465#true} is VALID [2018-11-23 10:02:37,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {1465#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1465#true} is VALID [2018-11-23 10:02:37,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {1465#true} assume true; {1465#true} is VALID [2018-11-23 10:02:37,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1465#true} #133#return; {1465#true} is VALID [2018-11-23 10:02:37,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {1465#true} call #t~ret17 := main(); {1465#true} is VALID [2018-11-23 10:02:37,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {1465#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1485#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {1485#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1485#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {1485#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1492#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:37,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {1492#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1492#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:37,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {1492#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1499#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:37,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {1499#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1499#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:37,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {1499#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1506#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:37,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {1506#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1506#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:37,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {1506#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1513#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:37,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {1513#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {1466#false} havoc ~i~0;~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1466#false} is VALID [2018-11-23 10:02:37,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {1466#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1466#false} is VALID [2018-11-23 10:02:37,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1466#false} is VALID [2018-11-23 10:02:37,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1466#false} is VALID [2018-11-23 10:02:37,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1466#false} is VALID [2018-11-23 10:02:37,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {1466#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1466#false} is VALID [2018-11-23 10:02:37,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,383 INFO L273 TraceCheckUtils]: 28: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1466#false} is VALID [2018-11-23 10:02:37,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {1466#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1466#false} is VALID [2018-11-23 10:02:37,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,384 INFO L273 TraceCheckUtils]: 32: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1466#false} is VALID [2018-11-23 10:02:37,384 INFO L273 TraceCheckUtils]: 33: Hoare triple {1466#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1466#false} is VALID [2018-11-23 10:02:37,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,384 INFO L273 TraceCheckUtils]: 36: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {1466#false} is VALID [2018-11-23 10:02:37,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {1466#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1466#false} is VALID [2018-11-23 10:02:37,385 INFO L273 TraceCheckUtils]: 38: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,385 INFO L273 TraceCheckUtils]: 39: Hoare triple {1466#false} havoc ~x~0;~x~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,385 INFO L273 TraceCheckUtils]: 40: Hoare triple {1466#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1466#false} is VALID [2018-11-23 10:02:37,386 INFO L256 TraceCheckUtils]: 41: Hoare triple {1466#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {1466#false} is VALID [2018-11-23 10:02:37,386 INFO L273 TraceCheckUtils]: 42: Hoare triple {1466#false} ~cond := #in~cond; {1466#false} is VALID [2018-11-23 10:02:37,386 INFO L273 TraceCheckUtils]: 43: Hoare triple {1466#false} assume 0bv32 == ~cond; {1466#false} is VALID [2018-11-23 10:02:37,386 INFO L273 TraceCheckUtils]: 44: Hoare triple {1466#false} assume !false; {1466#false} is VALID [2018-11-23 10:02:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 10:02:37,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:37,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {1466#false} assume !false; {1466#false} is VALID [2018-11-23 10:02:37,610 INFO L273 TraceCheckUtils]: 43: Hoare triple {1466#false} assume 0bv32 == ~cond; {1466#false} is VALID [2018-11-23 10:02:37,610 INFO L273 TraceCheckUtils]: 42: Hoare triple {1466#false} ~cond := #in~cond; {1466#false} is VALID [2018-11-23 10:02:37,610 INFO L256 TraceCheckUtils]: 41: Hoare triple {1466#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {1466#false} is VALID [2018-11-23 10:02:37,610 INFO L273 TraceCheckUtils]: 40: Hoare triple {1466#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1466#false} is VALID [2018-11-23 10:02:37,611 INFO L273 TraceCheckUtils]: 39: Hoare triple {1466#false} havoc ~x~0;~x~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,611 INFO L273 TraceCheckUtils]: 38: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {1466#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1466#false} is VALID [2018-11-23 10:02:37,611 INFO L273 TraceCheckUtils]: 36: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {1466#false} is VALID [2018-11-23 10:02:37,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {1466#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1466#false} is VALID [2018-11-23 10:02:37,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1466#false} is VALID [2018-11-23 10:02:37,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {1466#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1466#false} is VALID [2018-11-23 10:02:37,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1466#false} is VALID [2018-11-23 10:02:37,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {1466#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1466#false} is VALID [2018-11-23 10:02:37,615 INFO L273 TraceCheckUtils]: 24: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1466#false} is VALID [2018-11-23 10:02:37,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,615 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1466#false} is VALID [2018-11-23 10:02:37,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1466#false} is VALID [2018-11-23 10:02:37,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {1466#false} ~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {1466#false} assume !~bvslt32(~i~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {1466#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1466#false} is VALID [2018-11-23 10:02:37,617 INFO L273 TraceCheckUtils]: 16: Hoare triple {1466#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1466#false} is VALID [2018-11-23 10:02:37,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {1466#false} havoc ~i~0;~i~0 := 0bv32; {1466#false} is VALID [2018-11-23 10:02:37,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {1697#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1466#false} is VALID [2018-11-23 10:02:37,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {1701#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1697#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:37,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {1701#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1701#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {1708#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1701#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {1708#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1708#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {1715#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1708#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {1715#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1715#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {1722#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1715#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {1722#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1722#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {1465#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1722#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {1465#true} call #t~ret17 := main(); {1465#true} is VALID [2018-11-23 10:02:37,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1465#true} {1465#true} #133#return; {1465#true} is VALID [2018-11-23 10:02:37,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {1465#true} assume true; {1465#true} is VALID [2018-11-23 10:02:37,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {1465#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1465#true} is VALID [2018-11-23 10:02:37,642 INFO L256 TraceCheckUtils]: 0: Hoare triple {1465#true} call ULTIMATE.init(); {1465#true} is VALID [2018-11-23 10:02:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 10:02:37,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:37,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:37,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-23 10:02:37,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:37,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:37,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:37,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:37,783 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 12 states. [2018-11-23 10:02:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,741 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2018-11-23 10:02:38,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:38,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-23 10:02:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2018-11-23 10:02:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2018-11-23 10:02:38,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 104 transitions. [2018-11-23 10:02:39,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:39,026 INFO L225 Difference]: With dead ends: 97 [2018-11-23 10:02:39,026 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 10:02:39,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 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:02:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 10:02:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 10:02:39,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:39,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 10:02:39,058 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 10:02:39,058 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 10:02:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,061 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-23 10:02:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-23 10:02:39,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,062 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 10:02:39,062 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 10:02:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,065 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-23 10:02:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-23 10:02:39,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:39,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 10:02:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-11-23 10:02:39,068 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 45 [2018-11-23 10:02:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:39,068 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-23 10:02:39,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-23 10:02:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 10:02:39,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:39,070 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:39,070 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:39,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash -112743670, now seen corresponding path program 2 times [2018-11-23 10:02:39,071 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:39,071 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:02:39,091 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:39,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:39,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:39,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:39,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2112#true} is VALID [2018-11-23 10:02:39,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {2112#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2112#true} is VALID [2018-11-23 10:02:39,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2018-11-23 10:02:39,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #133#return; {2112#true} is VALID [2018-11-23 10:02:39,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret17 := main(); {2112#true} is VALID [2018-11-23 10:02:39,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {2112#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2132#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:39,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {2132#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2132#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:39,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {2132#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2139#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:39,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {2139#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2139#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:39,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {2139#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2146#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:39,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {2146#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2146#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:39,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {2146#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2153#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:39,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {2153#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2153#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:39,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {2153#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2160#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:39,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {2160#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2160#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:39,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {2160#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2167#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:39,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {2167#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2167#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:39,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {2167#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2174#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:39,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {2174#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2174#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:39,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {2174#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2181#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:39,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {2181#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2181#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:39,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {2181#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2188#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:39,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {2188#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2188#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:39,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {2188#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2195#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:39,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {2195#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2195#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:39,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {2195#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2202#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:39,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {2202#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:39,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {2113#false} havoc ~i~0;~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:39,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2113#false} is VALID [2018-11-23 10:02:39,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {2113#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2113#false} is VALID [2018-11-23 10:02:39,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:39,655 INFO L273 TraceCheckUtils]: 31: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:39,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2113#false} is VALID [2018-11-23 10:02:39,655 INFO L273 TraceCheckUtils]: 33: Hoare triple {2113#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2113#false} is VALID [2018-11-23 10:02:39,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:39,656 INFO L273 TraceCheckUtils]: 35: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:39,656 INFO L273 TraceCheckUtils]: 36: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2113#false} is VALID [2018-11-23 10:02:39,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {2113#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2113#false} is VALID [2018-11-23 10:02:39,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:39,657 INFO L273 TraceCheckUtils]: 39: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:39,657 INFO L273 TraceCheckUtils]: 40: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2113#false} is VALID [2018-11-23 10:02:39,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {2113#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2113#false} is VALID [2018-11-23 10:02:39,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:39,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:39,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2113#false} is VALID [2018-11-23 10:02:39,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {2113#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2113#false} is VALID [2018-11-23 10:02:39,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:39,659 INFO L273 TraceCheckUtils]: 47: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:39,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {2113#false} is VALID [2018-11-23 10:02:39,659 INFO L273 TraceCheckUtils]: 49: Hoare triple {2113#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2113#false} is VALID [2018-11-23 10:02:39,659 INFO L273 TraceCheckUtils]: 50: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:39,660 INFO L273 TraceCheckUtils]: 51: Hoare triple {2113#false} havoc ~x~0;~x~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:39,660 INFO L273 TraceCheckUtils]: 52: Hoare triple {2113#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2113#false} is VALID [2018-11-23 10:02:39,660 INFO L256 TraceCheckUtils]: 53: Hoare triple {2113#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {2113#false} is VALID [2018-11-23 10:02:39,661 INFO L273 TraceCheckUtils]: 54: Hoare triple {2113#false} ~cond := #in~cond; {2113#false} is VALID [2018-11-23 10:02:39,661 INFO L273 TraceCheckUtils]: 55: Hoare triple {2113#false} assume 0bv32 == ~cond; {2113#false} is VALID [2018-11-23 10:02:39,661 INFO L273 TraceCheckUtils]: 56: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2018-11-23 10:02:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 10:02:39,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:40,421 INFO L273 TraceCheckUtils]: 56: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2018-11-23 10:02:40,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {2113#false} assume 0bv32 == ~cond; {2113#false} is VALID [2018-11-23 10:02:40,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {2113#false} ~cond := #in~cond; {2113#false} is VALID [2018-11-23 10:02:40,422 INFO L256 TraceCheckUtils]: 53: Hoare triple {2113#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {2113#false} is VALID [2018-11-23 10:02:40,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {2113#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2113#false} is VALID [2018-11-23 10:02:40,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {2113#false} havoc ~x~0;~x~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:40,422 INFO L273 TraceCheckUtils]: 50: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:40,422 INFO L273 TraceCheckUtils]: 49: Hoare triple {2113#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2113#false} is VALID [2018-11-23 10:02:40,423 INFO L273 TraceCheckUtils]: 48: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {2113#false} is VALID [2018-11-23 10:02:40,423 INFO L273 TraceCheckUtils]: 47: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:40,423 INFO L273 TraceCheckUtils]: 46: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:40,424 INFO L273 TraceCheckUtils]: 45: Hoare triple {2113#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2113#false} is VALID [2018-11-23 10:02:40,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2113#false} is VALID [2018-11-23 10:02:40,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:40,425 INFO L273 TraceCheckUtils]: 42: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:40,425 INFO L273 TraceCheckUtils]: 41: Hoare triple {2113#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2113#false} is VALID [2018-11-23 10:02:40,425 INFO L273 TraceCheckUtils]: 40: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2113#false} is VALID [2018-11-23 10:02:40,425 INFO L273 TraceCheckUtils]: 39: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:40,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:40,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {2113#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2113#false} is VALID [2018-11-23 10:02:40,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2113#false} is VALID [2018-11-23 10:02:40,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:40,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:40,426 INFO L273 TraceCheckUtils]: 33: Hoare triple {2113#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2113#false} is VALID [2018-11-23 10:02:40,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2113#false} is VALID [2018-11-23 10:02:40,427 INFO L273 TraceCheckUtils]: 31: Hoare triple {2113#false} ~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:40,427 INFO L273 TraceCheckUtils]: 30: Hoare triple {2113#false} assume !~bvslt32(~i~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:40,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {2113#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2113#false} is VALID [2018-11-23 10:02:40,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {2113#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2113#false} is VALID [2018-11-23 10:02:40,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {2113#false} havoc ~i~0;~i~0 := 0bv32; {2113#false} is VALID [2018-11-23 10:02:40,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {2386#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2113#false} is VALID [2018-11-23 10:02:40,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {2390#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2386#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:40,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {2390#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2390#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {2397#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2390#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {2397#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2397#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {2404#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2397#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {2404#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2404#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {2411#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2404#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {2411#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2411#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {2418#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2411#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {2418#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2418#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {2425#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2418#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {2425#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2425#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {2432#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2425#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {2432#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2432#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {2439#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2432#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {2439#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2439#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {2446#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2439#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {2446#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2446#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {2453#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {2453#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2453#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {2112#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2453#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret17 := main(); {2112#true} is VALID [2018-11-23 10:02:40,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #133#return; {2112#true} is VALID [2018-11-23 10:02:40,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2018-11-23 10:02:40,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {2112#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2112#true} is VALID [2018-11-23 10:02:40,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2112#true} is VALID [2018-11-23 10:02:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:02:40,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:40,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:40,496 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-11-23 10:02:40,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:40,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:40,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:40,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:40,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:40,670 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 24 states. [2018-11-23 10:02:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,333 INFO L93 Difference]: Finished difference Result 121 states and 146 transitions. [2018-11-23 10:02:44,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:44,333 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-11-23 10:02:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 134 transitions. [2018-11-23 10:02:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 134 transitions. [2018-11-23 10:02:44,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 134 transitions. [2018-11-23 10:02:44,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:44,634 INFO L225 Difference]: With dead ends: 121 [2018-11-23 10:02:44,634 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 10:02:44,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 10:02:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 10:02:44,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:44,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-23 10:02:44,837 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 10:02:44,837 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 10:02:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,841 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-23 10:02:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 10:02:44,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:44,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:44,842 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 10:02:44,842 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 10:02:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,846 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-23 10:02:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 10:02:44,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:44,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:44,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:44,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 10:02:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-11-23 10:02:44,850 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 57 [2018-11-23 10:02:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:44,850 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-11-23 10:02:44,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 10:02:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 10:02:44,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:44,853 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:44,853 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:44,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:44,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1945386638, now seen corresponding path program 3 times [2018-11-23 10:02:44,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:44,854 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:02:44,875 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:45,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:02:45,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:45,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:45,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {2975#true} call ULTIMATE.init(); {2975#true} is VALID [2018-11-23 10:02:45,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {2975#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2975#true} is VALID [2018-11-23 10:02:45,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {2975#true} assume true; {2975#true} is VALID [2018-11-23 10:02:45,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2975#true} {2975#true} #133#return; {2975#true} is VALID [2018-11-23 10:02:45,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {2975#true} call #t~ret17 := main(); {2975#true} is VALID [2018-11-23 10:02:45,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {2975#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2975#true} is VALID [2018-11-23 10:02:45,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 19: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,169 INFO L273 TraceCheckUtils]: 21: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,169 INFO L273 TraceCheckUtils]: 22: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,169 INFO L273 TraceCheckUtils]: 24: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,170 INFO L273 TraceCheckUtils]: 26: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,170 INFO L273 TraceCheckUtils]: 27: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,170 INFO L273 TraceCheckUtils]: 29: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,170 INFO L273 TraceCheckUtils]: 30: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,171 INFO L273 TraceCheckUtils]: 31: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,171 INFO L273 TraceCheckUtils]: 32: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,172 INFO L273 TraceCheckUtils]: 35: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,172 INFO L273 TraceCheckUtils]: 38: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,172 INFO L273 TraceCheckUtils]: 39: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,173 INFO L273 TraceCheckUtils]: 40: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,173 INFO L273 TraceCheckUtils]: 44: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,174 INFO L273 TraceCheckUtils]: 45: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,174 INFO L273 TraceCheckUtils]: 46: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,174 INFO L273 TraceCheckUtils]: 47: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,174 INFO L273 TraceCheckUtils]: 48: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,175 INFO L273 TraceCheckUtils]: 49: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,175 INFO L273 TraceCheckUtils]: 50: Hoare triple {2975#true} assume !~bvslt32(~a~0, 100000bv32); {2975#true} is VALID [2018-11-23 10:02:45,175 INFO L273 TraceCheckUtils]: 51: Hoare triple {2975#true} havoc ~i~0;~i~0 := 0bv32; {2975#true} is VALID [2018-11-23 10:02:45,175 INFO L273 TraceCheckUtils]: 52: Hoare triple {2975#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2975#true} is VALID [2018-11-23 10:02:45,175 INFO L273 TraceCheckUtils]: 53: Hoare triple {2975#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2975#true} is VALID [2018-11-23 10:02:45,176 INFO L273 TraceCheckUtils]: 54: Hoare triple {2975#true} assume !~bvslt32(~i~0, 100000bv32); {2975#true} is VALID [2018-11-23 10:02:45,176 INFO L273 TraceCheckUtils]: 55: Hoare triple {2975#true} ~i~0 := 0bv32; {2975#true} is VALID [2018-11-23 10:02:45,176 INFO L273 TraceCheckUtils]: 56: Hoare triple {2975#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2975#true} is VALID [2018-11-23 10:02:45,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {2975#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2975#true} is VALID [2018-11-23 10:02:45,176 INFO L273 TraceCheckUtils]: 58: Hoare triple {2975#true} assume !~bvslt32(~i~0, 100000bv32); {2975#true} is VALID [2018-11-23 10:02:45,177 INFO L273 TraceCheckUtils]: 59: Hoare triple {2975#true} ~i~0 := 0bv32; {2975#true} is VALID [2018-11-23 10:02:45,177 INFO L273 TraceCheckUtils]: 60: Hoare triple {2975#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2975#true} is VALID [2018-11-23 10:02:45,177 INFO L273 TraceCheckUtils]: 61: Hoare triple {2975#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2975#true} is VALID [2018-11-23 10:02:45,177 INFO L273 TraceCheckUtils]: 62: Hoare triple {2975#true} assume !~bvslt32(~i~0, 100000bv32); {2975#true} is VALID [2018-11-23 10:02:45,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {2975#true} ~i~0 := 0bv32; {3169#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:45,204 INFO L273 TraceCheckUtils]: 64: Hoare triple {3169#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3169#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:45,212 INFO L273 TraceCheckUtils]: 65: Hoare triple {3169#(= main_~i~0 (_ bv0 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3176#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:45,225 INFO L273 TraceCheckUtils]: 66: Hoare triple {3176#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2976#false} is VALID [2018-11-23 10:02:45,225 INFO L273 TraceCheckUtils]: 67: Hoare triple {2976#false} ~i~0 := 0bv32; {2976#false} is VALID [2018-11-23 10:02:45,225 INFO L273 TraceCheckUtils]: 68: Hoare triple {2976#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2976#false} is VALID [2018-11-23 10:02:45,225 INFO L273 TraceCheckUtils]: 69: Hoare triple {2976#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2976#false} is VALID [2018-11-23 10:02:45,226 INFO L273 TraceCheckUtils]: 70: Hoare triple {2976#false} assume !~bvslt32(~i~0, 100000bv32); {2976#false} is VALID [2018-11-23 10:02:45,226 INFO L273 TraceCheckUtils]: 71: Hoare triple {2976#false} ~i~0 := 0bv32; {2976#false} is VALID [2018-11-23 10:02:45,226 INFO L273 TraceCheckUtils]: 72: Hoare triple {2976#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {2976#false} is VALID [2018-11-23 10:02:45,226 INFO L273 TraceCheckUtils]: 73: Hoare triple {2976#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2976#false} is VALID [2018-11-23 10:02:45,226 INFO L273 TraceCheckUtils]: 74: Hoare triple {2976#false} assume !~bvslt32(~i~0, 100000bv32); {2976#false} is VALID [2018-11-23 10:02:45,226 INFO L273 TraceCheckUtils]: 75: Hoare triple {2976#false} havoc ~x~0;~x~0 := 0bv32; {2976#false} is VALID [2018-11-23 10:02:45,226 INFO L273 TraceCheckUtils]: 76: Hoare triple {2976#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2976#false} is VALID [2018-11-23 10:02:45,227 INFO L256 TraceCheckUtils]: 77: Hoare triple {2976#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {2976#false} is VALID [2018-11-23 10:02:45,227 INFO L273 TraceCheckUtils]: 78: Hoare triple {2976#false} ~cond := #in~cond; {2976#false} is VALID [2018-11-23 10:02:45,227 INFO L273 TraceCheckUtils]: 79: Hoare triple {2976#false} assume 0bv32 == ~cond; {2976#false} is VALID [2018-11-23 10:02:45,227 INFO L273 TraceCheckUtils]: 80: Hoare triple {2976#false} assume !false; {2976#false} is VALID [2018-11-23 10:02:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2018-11-23 10:02:45,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:45,324 INFO L273 TraceCheckUtils]: 80: Hoare triple {2976#false} assume !false; {2976#false} is VALID [2018-11-23 10:02:45,324 INFO L273 TraceCheckUtils]: 79: Hoare triple {2976#false} assume 0bv32 == ~cond; {2976#false} is VALID [2018-11-23 10:02:45,324 INFO L273 TraceCheckUtils]: 78: Hoare triple {2976#false} ~cond := #in~cond; {2976#false} is VALID [2018-11-23 10:02:45,324 INFO L256 TraceCheckUtils]: 77: Hoare triple {2976#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {2976#false} is VALID [2018-11-23 10:02:45,324 INFO L273 TraceCheckUtils]: 76: Hoare triple {2976#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2976#false} is VALID [2018-11-23 10:02:45,324 INFO L273 TraceCheckUtils]: 75: Hoare triple {2976#false} havoc ~x~0;~x~0 := 0bv32; {2976#false} is VALID [2018-11-23 10:02:45,325 INFO L273 TraceCheckUtils]: 74: Hoare triple {2976#false} assume !~bvslt32(~i~0, 100000bv32); {2976#false} is VALID [2018-11-23 10:02:45,325 INFO L273 TraceCheckUtils]: 73: Hoare triple {2976#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2976#false} is VALID [2018-11-23 10:02:45,325 INFO L273 TraceCheckUtils]: 72: Hoare triple {2976#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {2976#false} is VALID [2018-11-23 10:02:45,325 INFO L273 TraceCheckUtils]: 71: Hoare triple {2976#false} ~i~0 := 0bv32; {2976#false} is VALID [2018-11-23 10:02:45,325 INFO L273 TraceCheckUtils]: 70: Hoare triple {2976#false} assume !~bvslt32(~i~0, 100000bv32); {2976#false} is VALID [2018-11-23 10:02:45,325 INFO L273 TraceCheckUtils]: 69: Hoare triple {2976#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2976#false} is VALID [2018-11-23 10:02:45,325 INFO L273 TraceCheckUtils]: 68: Hoare triple {2976#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2976#false} is VALID [2018-11-23 10:02:45,326 INFO L273 TraceCheckUtils]: 67: Hoare triple {2976#false} ~i~0 := 0bv32; {2976#false} is VALID [2018-11-23 10:02:45,326 INFO L273 TraceCheckUtils]: 66: Hoare triple {3264#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2976#false} is VALID [2018-11-23 10:02:45,326 INFO L273 TraceCheckUtils]: 65: Hoare triple {3268#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3264#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:45,327 INFO L273 TraceCheckUtils]: 64: Hoare triple {3268#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3268#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,327 INFO L273 TraceCheckUtils]: 63: Hoare triple {2975#true} ~i~0 := 0bv32; {3268#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,327 INFO L273 TraceCheckUtils]: 62: Hoare triple {2975#true} assume !~bvslt32(~i~0, 100000bv32); {2975#true} is VALID [2018-11-23 10:02:45,327 INFO L273 TraceCheckUtils]: 61: Hoare triple {2975#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2975#true} is VALID [2018-11-23 10:02:45,328 INFO L273 TraceCheckUtils]: 60: Hoare triple {2975#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2975#true} is VALID [2018-11-23 10:02:45,328 INFO L273 TraceCheckUtils]: 59: Hoare triple {2975#true} ~i~0 := 0bv32; {2975#true} is VALID [2018-11-23 10:02:45,328 INFO L273 TraceCheckUtils]: 58: Hoare triple {2975#true} assume !~bvslt32(~i~0, 100000bv32); {2975#true} is VALID [2018-11-23 10:02:45,328 INFO L273 TraceCheckUtils]: 57: Hoare triple {2975#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2975#true} is VALID [2018-11-23 10:02:45,328 INFO L273 TraceCheckUtils]: 56: Hoare triple {2975#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2975#true} is VALID [2018-11-23 10:02:45,328 INFO L273 TraceCheckUtils]: 55: Hoare triple {2975#true} ~i~0 := 0bv32; {2975#true} is VALID [2018-11-23 10:02:45,328 INFO L273 TraceCheckUtils]: 54: Hoare triple {2975#true} assume !~bvslt32(~i~0, 100000bv32); {2975#true} is VALID [2018-11-23 10:02:45,329 INFO L273 TraceCheckUtils]: 53: Hoare triple {2975#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2975#true} is VALID [2018-11-23 10:02:45,329 INFO L273 TraceCheckUtils]: 52: Hoare triple {2975#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2975#true} is VALID [2018-11-23 10:02:45,329 INFO L273 TraceCheckUtils]: 51: Hoare triple {2975#true} havoc ~i~0;~i~0 := 0bv32; {2975#true} is VALID [2018-11-23 10:02:45,329 INFO L273 TraceCheckUtils]: 50: Hoare triple {2975#true} assume !~bvslt32(~a~0, 100000bv32); {2975#true} is VALID [2018-11-23 10:02:45,329 INFO L273 TraceCheckUtils]: 49: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,329 INFO L273 TraceCheckUtils]: 48: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,329 INFO L273 TraceCheckUtils]: 47: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,330 INFO L273 TraceCheckUtils]: 46: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,330 INFO L273 TraceCheckUtils]: 45: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,330 INFO L273 TraceCheckUtils]: 44: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,330 INFO L273 TraceCheckUtils]: 43: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,330 INFO L273 TraceCheckUtils]: 41: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,331 INFO L273 TraceCheckUtils]: 38: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,331 INFO L273 TraceCheckUtils]: 37: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,331 INFO L273 TraceCheckUtils]: 36: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,331 INFO L273 TraceCheckUtils]: 35: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,331 INFO L273 TraceCheckUtils]: 34: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,332 INFO L273 TraceCheckUtils]: 32: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,333 INFO L273 TraceCheckUtils]: 21: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {2975#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#true} is VALID [2018-11-23 10:02:45,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {2975#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2975#true} is VALID [2018-11-23 10:02:45,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {2975#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2975#true} is VALID [2018-11-23 10:02:45,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {2975#true} call #t~ret17 := main(); {2975#true} is VALID [2018-11-23 10:02:45,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2975#true} {2975#true} #133#return; {2975#true} is VALID [2018-11-23 10:02:45,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {2975#true} assume true; {2975#true} is VALID [2018-11-23 10:02:45,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {2975#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2975#true} is VALID [2018-11-23 10:02:45,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {2975#true} call ULTIMATE.init(); {2975#true} is VALID [2018-11-23 10:02:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2018-11-23 10:02:45,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:45,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:45,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-23 10:02:45,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:45,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:45,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:45,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:45,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:45,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:45,444 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 6 states. [2018-11-23 10:02:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:46,143 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2018-11-23 10:02:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:46,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-23 10:02:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2018-11-23 10:02:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2018-11-23 10:02:46,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 135 transitions. [2018-11-23 10:02:46,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:46,382 INFO L225 Difference]: With dead ends: 153 [2018-11-23 10:02:46,382 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 10:02:46,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 10:02:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-11-23 10:02:46,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:46,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 122 states. [2018-11-23 10:02:46,460 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states. [2018-11-23 10:02:46,460 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states. [2018-11-23 10:02:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:46,463 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-23 10:02:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 10:02:46,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:46,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:46,464 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states. [2018-11-23 10:02:46,464 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states. [2018-11-23 10:02:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:46,468 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-23 10:02:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 10:02:46,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:46,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:46,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:46,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 10:02:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-11-23 10:02:46,472 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 81 [2018-11-23 10:02:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:46,473 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-23 10:02:46,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 10:02:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 10:02:46,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:46,475 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:46,475 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:46,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash 538114638, now seen corresponding path program 4 times [2018-11-23 10:02:46,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:46,476 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:46,498 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:46,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:46,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:46,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:47,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {4121#true} call ULTIMATE.init(); {4121#true} is VALID [2018-11-23 10:02:47,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {4121#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4121#true} is VALID [2018-11-23 10:02:47,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-23 10:02:47,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4121#true} {4121#true} #133#return; {4121#true} is VALID [2018-11-23 10:02:47,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {4121#true} call #t~ret17 := main(); {4121#true} is VALID [2018-11-23 10:02:47,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {4121#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4141#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:47,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {4141#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4141#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:47,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {4141#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4148#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:47,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {4148#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4148#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:47,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {4148#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4155#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:47,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {4155#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4155#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:47,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {4155#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4162#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:47,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {4162#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4162#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:47,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {4162#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4169#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:47,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {4169#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4169#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:47,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {4169#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4176#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:47,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {4176#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4176#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:47,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {4176#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4183#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:47,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {4183#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4183#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:47,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {4183#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4190#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:47,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {4190#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4190#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:47,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {4190#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4197#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:47,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {4197#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4197#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:47,227 INFO L273 TraceCheckUtils]: 23: Hoare triple {4197#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4204#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:47,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {4204#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4204#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:47,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {4204#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4211#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:47,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {4211#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4211#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:47,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {4211#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4218#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:47,230 INFO L273 TraceCheckUtils]: 28: Hoare triple {4218#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4218#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:47,231 INFO L273 TraceCheckUtils]: 29: Hoare triple {4218#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4225#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:47,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {4225#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4225#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:47,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {4225#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4232#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:47,232 INFO L273 TraceCheckUtils]: 32: Hoare triple {4232#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4232#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:47,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {4232#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4239#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:47,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {4239#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4239#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:47,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {4239#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4246#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:47,235 INFO L273 TraceCheckUtils]: 36: Hoare triple {4246#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4246#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:47,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {4246#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4253#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:47,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {4253#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4253#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:47,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {4253#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4260#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:47,237 INFO L273 TraceCheckUtils]: 40: Hoare triple {4260#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4260#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:47,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {4260#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4267#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:47,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {4267#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4267#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:47,239 INFO L273 TraceCheckUtils]: 43: Hoare triple {4267#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4274#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:47,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {4274#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4274#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:47,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {4274#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4281#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:47,240 INFO L273 TraceCheckUtils]: 46: Hoare triple {4281#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4281#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:47,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {4281#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4288#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:47,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {4288#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4288#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:47,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {4288#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4295#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 10:02:47,243 INFO L273 TraceCheckUtils]: 50: Hoare triple {4295#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:47,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {4122#false} havoc ~i~0;~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:47,243 INFO L273 TraceCheckUtils]: 52: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4122#false} is VALID [2018-11-23 10:02:47,243 INFO L273 TraceCheckUtils]: 53: Hoare triple {4122#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4122#false} is VALID [2018-11-23 10:02:47,244 INFO L273 TraceCheckUtils]: 54: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4122#false} is VALID [2018-11-23 10:02:47,244 INFO L273 TraceCheckUtils]: 55: Hoare triple {4122#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4122#false} is VALID [2018-11-23 10:02:47,244 INFO L273 TraceCheckUtils]: 56: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4122#false} is VALID [2018-11-23 10:02:47,244 INFO L273 TraceCheckUtils]: 57: Hoare triple {4122#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4122#false} is VALID [2018-11-23 10:02:47,244 INFO L273 TraceCheckUtils]: 58: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4122#false} is VALID [2018-11-23 10:02:47,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {4122#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4122#false} is VALID [2018-11-23 10:02:47,245 INFO L273 TraceCheckUtils]: 60: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:47,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:47,245 INFO L273 TraceCheckUtils]: 62: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4122#false} is VALID [2018-11-23 10:02:47,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {4122#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4122#false} is VALID [2018-11-23 10:02:47,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4122#false} is VALID [2018-11-23 10:02:47,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {4122#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4122#false} is VALID [2018-11-23 10:02:47,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4122#false} is VALID [2018-11-23 10:02:47,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {4122#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4122#false} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4122#false} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {4122#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4122#false} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 70: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 71: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 72: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4122#false} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 73: Hoare triple {4122#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4122#false} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 74: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4122#false} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 75: Hoare triple {4122#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4122#false} is VALID [2018-11-23 10:02:47,248 INFO L273 TraceCheckUtils]: 76: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4122#false} is VALID [2018-11-23 10:02:47,248 INFO L273 TraceCheckUtils]: 77: Hoare triple {4122#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4122#false} is VALID [2018-11-23 10:02:47,248 INFO L273 TraceCheckUtils]: 78: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4122#false} is VALID [2018-11-23 10:02:47,248 INFO L273 TraceCheckUtils]: 79: Hoare triple {4122#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4122#false} is VALID [2018-11-23 10:02:47,248 INFO L273 TraceCheckUtils]: 80: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:47,248 INFO L273 TraceCheckUtils]: 81: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:47,248 INFO L273 TraceCheckUtils]: 82: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4122#false} is VALID [2018-11-23 10:02:47,248 INFO L273 TraceCheckUtils]: 83: Hoare triple {4122#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4122#false} is VALID [2018-11-23 10:02:47,249 INFO L273 TraceCheckUtils]: 84: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4122#false} is VALID [2018-11-23 10:02:47,249 INFO L273 TraceCheckUtils]: 85: Hoare triple {4122#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4122#false} is VALID [2018-11-23 10:02:47,249 INFO L273 TraceCheckUtils]: 86: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4122#false} is VALID [2018-11-23 10:02:47,249 INFO L273 TraceCheckUtils]: 87: Hoare triple {4122#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4122#false} is VALID [2018-11-23 10:02:47,249 INFO L273 TraceCheckUtils]: 88: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4122#false} is VALID [2018-11-23 10:02:47,249 INFO L273 TraceCheckUtils]: 89: Hoare triple {4122#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4122#false} is VALID [2018-11-23 10:02:47,249 INFO L273 TraceCheckUtils]: 90: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:47,250 INFO L273 TraceCheckUtils]: 91: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:47,250 INFO L273 TraceCheckUtils]: 92: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4122#false} is VALID [2018-11-23 10:02:47,250 INFO L273 TraceCheckUtils]: 93: Hoare triple {4122#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4122#false} is VALID [2018-11-23 10:02:47,250 INFO L273 TraceCheckUtils]: 94: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4122#false} is VALID [2018-11-23 10:02:47,250 INFO L273 TraceCheckUtils]: 95: Hoare triple {4122#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4122#false} is VALID [2018-11-23 10:02:47,250 INFO L273 TraceCheckUtils]: 96: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4122#false} is VALID [2018-11-23 10:02:47,250 INFO L273 TraceCheckUtils]: 97: Hoare triple {4122#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4122#false} is VALID [2018-11-23 10:02:47,250 INFO L273 TraceCheckUtils]: 98: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4122#false} is VALID [2018-11-23 10:02:47,251 INFO L273 TraceCheckUtils]: 99: Hoare triple {4122#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4122#false} is VALID [2018-11-23 10:02:47,251 INFO L273 TraceCheckUtils]: 100: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:47,251 INFO L273 TraceCheckUtils]: 101: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:47,251 INFO L273 TraceCheckUtils]: 102: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4122#false} is VALID [2018-11-23 10:02:47,251 INFO L273 TraceCheckUtils]: 103: Hoare triple {4122#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4122#false} is VALID [2018-11-23 10:02:47,251 INFO L273 TraceCheckUtils]: 104: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4122#false} is VALID [2018-11-23 10:02:47,251 INFO L273 TraceCheckUtils]: 105: Hoare triple {4122#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4122#false} is VALID [2018-11-23 10:02:47,251 INFO L273 TraceCheckUtils]: 106: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4122#false} is VALID [2018-11-23 10:02:47,252 INFO L273 TraceCheckUtils]: 107: Hoare triple {4122#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4122#false} is VALID [2018-11-23 10:02:47,252 INFO L273 TraceCheckUtils]: 108: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4122#false} is VALID [2018-11-23 10:02:47,252 INFO L273 TraceCheckUtils]: 109: Hoare triple {4122#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4122#false} is VALID [2018-11-23 10:02:47,252 INFO L273 TraceCheckUtils]: 110: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:47,252 INFO L273 TraceCheckUtils]: 111: Hoare triple {4122#false} havoc ~x~0;~x~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:47,252 INFO L273 TraceCheckUtils]: 112: Hoare triple {4122#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4122#false} is VALID [2018-11-23 10:02:47,252 INFO L256 TraceCheckUtils]: 113: Hoare triple {4122#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {4122#false} is VALID [2018-11-23 10:02:47,253 INFO L273 TraceCheckUtils]: 114: Hoare triple {4122#false} ~cond := #in~cond; {4122#false} is VALID [2018-11-23 10:02:47,253 INFO L273 TraceCheckUtils]: 115: Hoare triple {4122#false} assume 0bv32 == ~cond; {4122#false} is VALID [2018-11-23 10:02:47,253 INFO L273 TraceCheckUtils]: 116: Hoare triple {4122#false} assume !false; {4122#false} is VALID [2018-11-23 10:02:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-23 10:02:47,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:49,700 INFO L273 TraceCheckUtils]: 116: Hoare triple {4122#false} assume !false; {4122#false} is VALID [2018-11-23 10:02:49,701 INFO L273 TraceCheckUtils]: 115: Hoare triple {4122#false} assume 0bv32 == ~cond; {4122#false} is VALID [2018-11-23 10:02:49,701 INFO L273 TraceCheckUtils]: 114: Hoare triple {4122#false} ~cond := #in~cond; {4122#false} is VALID [2018-11-23 10:02:49,701 INFO L256 TraceCheckUtils]: 113: Hoare triple {4122#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1bv32 else 0bv32)); {4122#false} is VALID [2018-11-23 10:02:49,701 INFO L273 TraceCheckUtils]: 112: Hoare triple {4122#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem16 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4122#false} is VALID [2018-11-23 10:02:49,701 INFO L273 TraceCheckUtils]: 111: Hoare triple {4122#false} havoc ~x~0;~x~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:49,701 INFO L273 TraceCheckUtils]: 110: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:49,702 INFO L273 TraceCheckUtils]: 109: Hoare triple {4122#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4122#false} is VALID [2018-11-23 10:02:49,702 INFO L273 TraceCheckUtils]: 108: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4122#false} is VALID [2018-11-23 10:02:49,702 INFO L273 TraceCheckUtils]: 107: Hoare triple {4122#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4122#false} is VALID [2018-11-23 10:02:49,702 INFO L273 TraceCheckUtils]: 106: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4122#false} is VALID [2018-11-23 10:02:49,702 INFO L273 TraceCheckUtils]: 105: Hoare triple {4122#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4122#false} is VALID [2018-11-23 10:02:49,702 INFO L273 TraceCheckUtils]: 104: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4122#false} is VALID [2018-11-23 10:02:49,703 INFO L273 TraceCheckUtils]: 103: Hoare triple {4122#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4122#false} is VALID [2018-11-23 10:02:49,703 INFO L273 TraceCheckUtils]: 102: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4122#false} is VALID [2018-11-23 10:02:49,703 INFO L273 TraceCheckUtils]: 101: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:49,703 INFO L273 TraceCheckUtils]: 100: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:49,703 INFO L273 TraceCheckUtils]: 99: Hoare triple {4122#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4122#false} is VALID [2018-11-23 10:02:49,704 INFO L273 TraceCheckUtils]: 98: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4122#false} is VALID [2018-11-23 10:02:49,704 INFO L273 TraceCheckUtils]: 97: Hoare triple {4122#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4122#false} is VALID [2018-11-23 10:02:49,704 INFO L273 TraceCheckUtils]: 96: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4122#false} is VALID [2018-11-23 10:02:49,704 INFO L273 TraceCheckUtils]: 95: Hoare triple {4122#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4122#false} is VALID [2018-11-23 10:02:49,704 INFO L273 TraceCheckUtils]: 94: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4122#false} is VALID [2018-11-23 10:02:49,704 INFO L273 TraceCheckUtils]: 93: Hoare triple {4122#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4122#false} is VALID [2018-11-23 10:02:49,705 INFO L273 TraceCheckUtils]: 92: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4122#false} is VALID [2018-11-23 10:02:49,705 INFO L273 TraceCheckUtils]: 91: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:49,705 INFO L273 TraceCheckUtils]: 90: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:49,705 INFO L273 TraceCheckUtils]: 89: Hoare triple {4122#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4122#false} is VALID [2018-11-23 10:02:49,705 INFO L273 TraceCheckUtils]: 88: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4122#false} is VALID [2018-11-23 10:02:49,705 INFO L273 TraceCheckUtils]: 87: Hoare triple {4122#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4122#false} is VALID [2018-11-23 10:02:49,706 INFO L273 TraceCheckUtils]: 86: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4122#false} is VALID [2018-11-23 10:02:49,706 INFO L273 TraceCheckUtils]: 85: Hoare triple {4122#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4122#false} is VALID [2018-11-23 10:02:49,706 INFO L273 TraceCheckUtils]: 84: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4122#false} is VALID [2018-11-23 10:02:49,706 INFO L273 TraceCheckUtils]: 83: Hoare triple {4122#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4122#false} is VALID [2018-11-23 10:02:49,706 INFO L273 TraceCheckUtils]: 82: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4122#false} is VALID [2018-11-23 10:02:49,707 INFO L273 TraceCheckUtils]: 81: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:49,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:49,707 INFO L273 TraceCheckUtils]: 79: Hoare triple {4122#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4122#false} is VALID [2018-11-23 10:02:49,707 INFO L273 TraceCheckUtils]: 78: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4122#false} is VALID [2018-11-23 10:02:49,707 INFO L273 TraceCheckUtils]: 77: Hoare triple {4122#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4122#false} is VALID [2018-11-23 10:02:49,708 INFO L273 TraceCheckUtils]: 76: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4122#false} is VALID [2018-11-23 10:02:49,708 INFO L273 TraceCheckUtils]: 75: Hoare triple {4122#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4122#false} is VALID [2018-11-23 10:02:49,708 INFO L273 TraceCheckUtils]: 74: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4122#false} is VALID [2018-11-23 10:02:49,708 INFO L273 TraceCheckUtils]: 73: Hoare triple {4122#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4122#false} is VALID [2018-11-23 10:02:49,708 INFO L273 TraceCheckUtils]: 72: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4122#false} is VALID [2018-11-23 10:02:49,708 INFO L273 TraceCheckUtils]: 71: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:49,709 INFO L273 TraceCheckUtils]: 70: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:49,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {4122#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4122#false} is VALID [2018-11-23 10:02:49,709 INFO L273 TraceCheckUtils]: 68: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4122#false} is VALID [2018-11-23 10:02:49,709 INFO L273 TraceCheckUtils]: 67: Hoare triple {4122#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4122#false} is VALID [2018-11-23 10:02:49,709 INFO L273 TraceCheckUtils]: 66: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4122#false} is VALID [2018-11-23 10:02:49,710 INFO L273 TraceCheckUtils]: 65: Hoare triple {4122#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4122#false} is VALID [2018-11-23 10:02:49,710 INFO L273 TraceCheckUtils]: 64: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4122#false} is VALID [2018-11-23 10:02:49,710 INFO L273 TraceCheckUtils]: 63: Hoare triple {4122#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4122#false} is VALID [2018-11-23 10:02:49,710 INFO L273 TraceCheckUtils]: 62: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4122#false} is VALID [2018-11-23 10:02:49,710 INFO L273 TraceCheckUtils]: 61: Hoare triple {4122#false} ~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:49,710 INFO L273 TraceCheckUtils]: 60: Hoare triple {4122#false} assume !~bvslt32(~i~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:49,711 INFO L273 TraceCheckUtils]: 59: Hoare triple {4122#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4122#false} is VALID [2018-11-23 10:02:49,711 INFO L273 TraceCheckUtils]: 58: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4122#false} is VALID [2018-11-23 10:02:49,711 INFO L273 TraceCheckUtils]: 57: Hoare triple {4122#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4122#false} is VALID [2018-11-23 10:02:49,711 INFO L273 TraceCheckUtils]: 56: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4122#false} is VALID [2018-11-23 10:02:49,711 INFO L273 TraceCheckUtils]: 55: Hoare triple {4122#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4122#false} is VALID [2018-11-23 10:02:49,711 INFO L273 TraceCheckUtils]: 54: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4122#false} is VALID [2018-11-23 10:02:49,712 INFO L273 TraceCheckUtils]: 53: Hoare triple {4122#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4122#false} is VALID [2018-11-23 10:02:49,712 INFO L273 TraceCheckUtils]: 52: Hoare triple {4122#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4122#false} is VALID [2018-11-23 10:02:49,712 INFO L273 TraceCheckUtils]: 51: Hoare triple {4122#false} havoc ~i~0;~i~0 := 0bv32; {4122#false} is VALID [2018-11-23 10:02:49,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {4695#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {4122#false} is VALID [2018-11-23 10:02:49,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {4699#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4695#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:49,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {4699#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4699#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {4706#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4699#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,750 INFO L273 TraceCheckUtils]: 46: Hoare triple {4706#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4706#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,754 INFO L273 TraceCheckUtils]: 45: Hoare triple {4713#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4706#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,754 INFO L273 TraceCheckUtils]: 44: Hoare triple {4713#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4713#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,758 INFO L273 TraceCheckUtils]: 43: Hoare triple {4720#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4713#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,758 INFO L273 TraceCheckUtils]: 42: Hoare triple {4720#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4720#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,765 INFO L273 TraceCheckUtils]: 41: Hoare triple {4727#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4720#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {4727#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4727#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,771 INFO L273 TraceCheckUtils]: 39: Hoare triple {4734#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4727#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {4734#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4734#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,777 INFO L273 TraceCheckUtils]: 37: Hoare triple {4741#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4734#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,777 INFO L273 TraceCheckUtils]: 36: Hoare triple {4741#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4741#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {4748#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4741#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {4748#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4748#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,788 INFO L273 TraceCheckUtils]: 33: Hoare triple {4755#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4748#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {4755#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4755#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {4762#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4755#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,794 INFO L273 TraceCheckUtils]: 30: Hoare triple {4762#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4762#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {4769#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4762#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {4769#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4769#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {4776#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4769#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {4776#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4776#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {4783#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4776#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {4783#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4783#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {4790#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4783#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {4790#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4790#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {4797#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4790#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {4797#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4797#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {4804#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4797#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {4804#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4804#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {4811#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4804#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {4811#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4811#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,842 INFO L273 TraceCheckUtils]: 15: Hoare triple {4818#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4811#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,842 INFO L273 TraceCheckUtils]: 14: Hoare triple {4818#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4818#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {4825#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4818#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,848 INFO L273 TraceCheckUtils]: 12: Hoare triple {4825#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4825#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {4832#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4825#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {4832#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4832#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {4839#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4832#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {4839#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4839#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {4846#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4839#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {4846#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4846#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {4121#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4846#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {4121#true} call #t~ret17 := main(); {4121#true} is VALID [2018-11-23 10:02:49,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4121#true} {4121#true} #133#return; {4121#true} is VALID [2018-11-23 10:02:49,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-23 10:02:49,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {4121#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4121#true} is VALID [2018-11-23 10:02:49,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {4121#true} call ULTIMATE.init(); {4121#true} is VALID [2018-11-23 10:02:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-23 10:02:49,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:49,888 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 117 [2018-11-23 10:02:49,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:49,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:50,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:50,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:50,195 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 48 states. [2018-11-23 10:02:54,802 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:02:55,250 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:02:55,719 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:02:56,209 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:02:56,760 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:02:57,327 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:03:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:05,961 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2018-11-23 10:03:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:03:05,962 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 117 [2018-11-23 10:03:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:03:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 194 transitions. [2018-11-23 10:03:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 194 transitions. [2018-11-23 10:03:05,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 194 transitions. [2018-11-23 10:03:06,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:06,358 INFO L225 Difference]: With dead ends: 241 [2018-11-23 10:03:06,359 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 10:03:06,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:03:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 10:03:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-11-23 10:03:06,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:03:06,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 170 states. [2018-11-23 10:03:06,476 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 170 states. [2018-11-23 10:03:06,476 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 170 states. [2018-11-23 10:03:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:06,481 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-11-23 10:03:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 177 transitions. [2018-11-23 10:03:06,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:06,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:06,482 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 170 states. [2018-11-23 10:03:06,482 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 170 states. [2018-11-23 10:03:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:06,487 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-11-23 10:03:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 177 transitions. [2018-11-23 10:03:06,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:06,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:06,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:03:06,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:03:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-23 10:03:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 177 transitions. [2018-11-23 10:03:06,493 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 177 transitions. Word has length 117 [2018-11-23 10:03:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:03:06,494 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 177 transitions. [2018-11-23 10:03:06,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:03:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 177 transitions. [2018-11-23 10:03:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-23 10:03:06,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:03:06,496 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:03:06,496 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:03:06,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:03:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash -492513506, now seen corresponding path program 5 times [2018-11-23 10:03:06,497 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:03:06,497 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:03:06,515 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1