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_copy3_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:54:54,710 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:54:54,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:54:54,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:54:54,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:54:54,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:54:54,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:54:54,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:54:54,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:54:54,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:54:54,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:54:54,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:54:54,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:54:54,737 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:54:54,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:54:54,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:54:54,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:54:54,742 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:54:54,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:54:54,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:54:54,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:54:54,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:54:54,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:54:54,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:54:54,763 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:54:54,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:54:54,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:54:54,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:54:54,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:54:54,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:54:54,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:54:54,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:54:54,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:54:54,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:54:54,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:54:54,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:54:54,775 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 09:54:54,806 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:54:54,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:54:54,811 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:54:54,811 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:54:54,812 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:54:54,812 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:54:54,812 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:54:54,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:54:54,814 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:54:54,814 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:54:54,814 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:54:54,814 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:54:54,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:54:54,815 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:54:54,815 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:54:54,815 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:54:54,815 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:54:54,815 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:54:54,815 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:54:54,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:54:54,817 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:54:54,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:54:54,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:54:54,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:54:54,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:54,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:54:54,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:54:54,818 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:54:54,819 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:54:54,819 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:54:54,819 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:54:54,819 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:54:54,819 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:54:54,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:54:54,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:54:54,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:54:54,897 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:54:54,902 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:54:54,903 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_false-unreach-call_ground.i [2018-11-23 09:54:54,969 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ca5282/38310c0313d34f429614b6856f5ffe94/FLAGef21fb4b3 [2018-11-23 09:54:55,452 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:54:55,453 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_false-unreach-call_ground.i [2018-11-23 09:54:55,460 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ca5282/38310c0313d34f429614b6856f5ffe94/FLAGef21fb4b3 [2018-11-23 09:54:55,777 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ca5282/38310c0313d34f429614b6856f5ffe94 [2018-11-23 09:54:55,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:54:55,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:54:55,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:55,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:54:55,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:54:55,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d9d738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:55, skipping insertion in model container [2018-11-23 09:54:55,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:54:55,835 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:54:56,067 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,073 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:54:56,103 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,128 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:54:56,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56 WrapperNode [2018-11-23 09:54:56,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:54:56,130 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:54:56,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:54:56,157 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:54:56,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:54:56,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:54:56,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:54:56,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (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 09:54:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:54:56,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:54:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:54:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:54:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:54:56,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:54:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:54:56,335 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:54:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:54:56,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:54:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:54:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:54:57,083 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:54:57,083 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 09:54:57,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57 BoogieIcfgContainer [2018-11-23 09:54:57,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:54:57,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:54:57,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:54:57,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:54:57,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:54:55" (1/3) ... [2018-11-23 09:54:57,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f081dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (2/3) ... [2018-11-23 09:54:57,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f081dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57" (3/3) ... [2018-11-23 09:54:57,093 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy3_false-unreach-call_ground.i [2018-11-23 09:54:57,104 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:54:57,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:54:57,130 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:54:57,168 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:54:57,169 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:54:57,169 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:54:57,169 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:54:57,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:54:57,170 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:54:57,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:54:57,170 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:54:57,170 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:54:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 09:54:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:54:57,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:57,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:57,201 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:57,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash -496428460, now seen corresponding path program 1 times [2018-11-23 09:54:57,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:57,213 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 09:54:57,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:57,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 09:54:57,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {36#true} is VALID [2018-11-23 09:54:57,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 09:54:57,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #91#return; {36#true} is VALID [2018-11-23 09:54:57,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret12 := main(); {36#true} is VALID [2018-11-23 09:54:57,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#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);havoc ~a~0;~a~0 := 0bv32; {36#true} is VALID [2018-11-23 09:54:57,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 09:54:57,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} havoc ~i~0;~i~0 := 0bv32; {37#false} is VALID [2018-11-23 09:54:57,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !~bvslt32(~i~0, 100000bv32); {37#false} is VALID [2018-11-23 09:54:57,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0bv32; {37#false} is VALID [2018-11-23 09:54:57,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !~bvslt32(~i~0, 100000bv32); {37#false} is VALID [2018-11-23 09:54:57,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~i~0 := 0bv32; {37#false} is VALID [2018-11-23 09:54:57,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume !~bvslt32(~i~0, 100000bv32); {37#false} is VALID [2018-11-23 09:54:57,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} havoc ~x~0;~x~0 := 0bv32; {37#false} is VALID [2018-11-23 09:54:57,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {37#false} is VALID [2018-11-23 09:54:57,447 INFO L256 TraceCheckUtils]: 15: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {37#false} is VALID [2018-11-23 09:54:57,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-23 09:54:57,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} assume 0bv32 == ~cond; {37#false} is VALID [2018-11-23 09:54:57,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 09:54:57,452 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 09:54:57,452 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:57,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:57,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:54:57,463 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 09:54:57,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:57,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:54:57,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:57,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:54:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:54:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:57,699 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 09:54:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:57,830 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-23 09:54:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:54:57,830 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 09:54:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 09:54:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 09:54:57,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-23 09:54:58,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,178 INFO L225 Difference]: With dead ends: 58 [2018-11-23 09:54:58,179 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 09:54:58,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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 09:54:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 09:54:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 09:54:58,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:58,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 09:54:58,247 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 09:54:58,247 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 09:54:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,252 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 09:54:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 09:54:58,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,254 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 09:54:58,254 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 09:54:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,260 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 09:54:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 09:54:58,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:58,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 09:54:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 09:54:58,273 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2018-11-23 09:54:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:58,273 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 09:54:58,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:54:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 09:54:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:54:58,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:58,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:58,281 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:58,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1263989582, now seen corresponding path program 1 times [2018-11-23 09:54:58,282 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:58,282 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 09:54:58,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:58,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {264#true} is VALID [2018-11-23 09:54:58,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {264#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {264#true} is VALID [2018-11-23 09:54:58,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2018-11-23 09:54:58,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {264#true} {264#true} #91#return; {264#true} is VALID [2018-11-23 09:54:58,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {264#true} call #t~ret12 := main(); {264#true} is VALID [2018-11-23 09:54:58,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {264#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);havoc ~a~0;~a~0 := 0bv32; {284#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:58,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {284#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {265#false} is VALID [2018-11-23 09:54:58,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {265#false} havoc ~i~0;~i~0 := 0bv32; {265#false} is VALID [2018-11-23 09:54:58,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {265#false} assume !~bvslt32(~i~0, 100000bv32); {265#false} is VALID [2018-11-23 09:54:58,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {265#false} ~i~0 := 0bv32; {265#false} is VALID [2018-11-23 09:54:58,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {265#false} assume !~bvslt32(~i~0, 100000bv32); {265#false} is VALID [2018-11-23 09:54:58,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {265#false} ~i~0 := 0bv32; {265#false} is VALID [2018-11-23 09:54:58,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {265#false} assume !~bvslt32(~i~0, 100000bv32); {265#false} is VALID [2018-11-23 09:54:58,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {265#false} havoc ~x~0;~x~0 := 0bv32; {265#false} is VALID [2018-11-23 09:54:58,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {265#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {265#false} is VALID [2018-11-23 09:54:58,750 INFO L256 TraceCheckUtils]: 15: Hoare triple {265#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {265#false} is VALID [2018-11-23 09:54:58,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {265#false} ~cond := #in~cond; {265#false} is VALID [2018-11-23 09:54:58,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {265#false} assume 0bv32 == ~cond; {265#false} is VALID [2018-11-23 09:54:58,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {265#false} assume !false; {265#false} is VALID [2018-11-23 09:54:58,753 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 09:54:58,753 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:58,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:58,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:54:58,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 09:54:58,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:58,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:54:58,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:54:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:54:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:58,876 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 09:54:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,103 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 09:54:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:54:59,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 09:54:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 09:54:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 09:54:59,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 09:54:59,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,336 INFO L225 Difference]: With dead ends: 50 [2018-11-23 09:54:59,336 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 09:54:59,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 09:54:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 09:54:59,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:59,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 09:54:59,360 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 09:54:59,360 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 09:54:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,364 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 09:54:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 09:54:59,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,365 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 09:54:59,365 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 09:54:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,368 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 09:54:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 09:54:59,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:59,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 09:54:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 09:54:59,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2018-11-23 09:54:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:59,375 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 09:54:59,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:54:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 09:54:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 09:54:59,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:59,380 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] [2018-11-23 09:54:59,380 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:59,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1258945684, now seen corresponding path program 1 times [2018-11-23 09:54:59,381 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:59,382 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 09:54:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:59,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2018-11-23 09:54:59,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {492#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {492#true} is VALID [2018-11-23 09:54:59,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2018-11-23 09:54:59,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {492#true} {492#true} #91#return; {492#true} is VALID [2018-11-23 09:54:59,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {492#true} call #t~ret12 := main(); {492#true} is VALID [2018-11-23 09:54:59,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#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);havoc ~a~0;~a~0 := 0bv32; {512#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {512#(= 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {512#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {512#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {519#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:54:59,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {519#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {493#false} is VALID [2018-11-23 09:54:59,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {493#false} havoc ~i~0;~i~0 := 0bv32; {493#false} is VALID [2018-11-23 09:54:59,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 09:54:59,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {493#false} ~i~0 := 0bv32; {493#false} is VALID [2018-11-23 09:54:59,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 09:54:59,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {493#false} ~i~0 := 0bv32; {493#false} is VALID [2018-11-23 09:54:59,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 09:54:59,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {493#false} havoc ~x~0;~x~0 := 0bv32; {493#false} is VALID [2018-11-23 09:54:59,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {493#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {493#false} is VALID [2018-11-23 09:54:59,553 INFO L256 TraceCheckUtils]: 17: Hoare triple {493#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {493#false} is VALID [2018-11-23 09:54:59,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {493#false} ~cond := #in~cond; {493#false} is VALID [2018-11-23 09:54:59,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {493#false} assume 0bv32 == ~cond; {493#false} is VALID [2018-11-23 09:54:59,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {493#false} assume !false; {493#false} is VALID [2018-11-23 09:54:59,555 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 09:54:59,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:54:59,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {493#false} assume !false; {493#false} is VALID [2018-11-23 09:54:59,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {493#false} assume 0bv32 == ~cond; {493#false} is VALID [2018-11-23 09:54:59,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {493#false} ~cond := #in~cond; {493#false} is VALID [2018-11-23 09:54:59,649 INFO L256 TraceCheckUtils]: 17: Hoare triple {493#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {493#false} is VALID [2018-11-23 09:54:59,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {493#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {493#false} is VALID [2018-11-23 09:54:59,649 INFO L273 TraceCheckUtils]: 15: Hoare triple {493#false} havoc ~x~0;~x~0 := 0bv32; {493#false} is VALID [2018-11-23 09:54:59,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 09:54:59,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {493#false} ~i~0 := 0bv32; {493#false} is VALID [2018-11-23 09:54:59,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 09:54:59,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {493#false} ~i~0 := 0bv32; {493#false} is VALID [2018-11-23 09:54:59,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 09:54:59,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {493#false} havoc ~i~0;~i~0 := 0bv32; {493#false} is VALID [2018-11-23 09:54:59,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {595#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {493#false} is VALID [2018-11-23 09:54:59,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {599#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {595#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:54:59,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {599#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:54:59,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#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);havoc ~a~0;~a~0 := 0bv32; {599#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:54:59,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {492#true} call #t~ret12 := main(); {492#true} is VALID [2018-11-23 09:54:59,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {492#true} {492#true} #91#return; {492#true} is VALID [2018-11-23 09:54:59,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2018-11-23 09:54:59,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {492#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {492#true} is VALID [2018-11-23 09:54:59,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2018-11-23 09:54:59,706 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 09:54:59,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:54:59,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:54:59,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 09:54:59,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:59,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:54:59,824 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 09:54:59,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:54:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:54:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:54:59,825 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2018-11-23 09:55:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,212 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-23 09:55:00,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:00,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 09:55:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 09:55:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 09:55:00,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-23 09:55:00,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,462 INFO L225 Difference]: With dead ends: 55 [2018-11-23 09:55:00,462 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 09:55:00,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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 09:55:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 09:55:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 09:55:00,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:00,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 09:55:00,481 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 09:55:00,481 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 09:55:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,487 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 09:55:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 09:55:00,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,488 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 09:55:00,489 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 09:55:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,494 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 09:55:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 09:55:00,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 09:55:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 09:55:00,499 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-11-23 09:55:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,499 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 09:55:00,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 09:55:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:55:00,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,501 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] [2018-11-23 09:55:00,501 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1520609594, now seen corresponding path program 2 times [2018-11-23 09:55:00,502 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,502 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 09:55:00,520 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:00,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:55:00,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:00,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2018-11-23 09:55:00,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {821#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {821#true} is VALID [2018-11-23 09:55:00,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-23 09:55:00,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #91#return; {821#true} is VALID [2018-11-23 09:55:00,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret12 := main(); {821#true} is VALID [2018-11-23 09:55:00,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {821#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);havoc ~a~0;~a~0 := 0bv32; {821#true} is VALID [2018-11-23 09:55:00,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {821#true} is VALID [2018-11-23 09:55:00,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {821#true} is VALID [2018-11-23 09:55:00,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {821#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {821#true} is VALID [2018-11-23 09:55:00,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {821#true} is VALID [2018-11-23 09:55:00,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {821#true} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {821#true} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {821#true} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {821#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {821#true} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {821#true} assume !~bvslt32(~a~0, 100000bv32); {821#true} is VALID [2018-11-23 09:55:00,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {821#true} havoc ~i~0;~i~0 := 0bv32; {871#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {871#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {822#false} is VALID [2018-11-23 09:55:00,638 INFO L273 TraceCheckUtils]: 17: Hoare triple {822#false} ~i~0 := 0bv32; {822#false} is VALID [2018-11-23 09:55:00,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {822#false} assume !~bvslt32(~i~0, 100000bv32); {822#false} is VALID [2018-11-23 09:55:00,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {822#false} ~i~0 := 0bv32; {822#false} is VALID [2018-11-23 09:55:00,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {822#false} assume !~bvslt32(~i~0, 100000bv32); {822#false} is VALID [2018-11-23 09:55:00,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {822#false} havoc ~x~0;~x~0 := 0bv32; {822#false} is VALID [2018-11-23 09:55:00,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {822#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {822#false} is VALID [2018-11-23 09:55:00,639 INFO L256 TraceCheckUtils]: 23: Hoare triple {822#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {822#false} is VALID [2018-11-23 09:55:00,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2018-11-23 09:55:00,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {822#false} assume 0bv32 == ~cond; {822#false} is VALID [2018-11-23 09:55:00,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {822#false} assume !false; {822#false} is VALID [2018-11-23 09:55:00,642 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 09:55:00,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:00,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:00,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:55:00,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 09:55:00,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:00,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:55:00,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:55:00,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:55:00,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:00,682 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 3 states. [2018-11-23 09:55:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,861 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-23 09:55:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:55:00,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 09:55:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 09:55:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 09:55:00,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-23 09:55:01,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,034 INFO L225 Difference]: With dead ends: 58 [2018-11-23 09:55:01,034 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 09:55:01,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 09:55:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 09:55:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 09:55:01,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:01,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 09:55:01,059 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 09:55:01,059 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 09:55:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,061 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 09:55:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 09:55:01,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,062 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 09:55:01,063 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 09:55:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,065 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 09:55:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 09:55:01,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:01,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 09:55:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 09:55:01,069 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 27 [2018-11-23 09:55:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:01,069 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 09:55:01,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 09:55:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 09:55:01,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:01,071 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 09:55:01,071 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:01,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2019450144, now seen corresponding path program 1 times [2018-11-23 09:55:01,072 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:01,072 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 09:55:01,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:01,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:01,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1123#true} is VALID [2018-11-23 09:55:01,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {1123#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1123#true} is VALID [2018-11-23 09:55:01,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-23 09:55:01,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #91#return; {1123#true} is VALID [2018-11-23 09:55:01,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret12 := main(); {1123#true} is VALID [2018-11-23 09:55:01,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {1123#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);havoc ~a~0;~a~0 := 0bv32; {1143#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:01,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {1143#(= 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1143#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:01,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {1143#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1150#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:01,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {1150#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1150#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:01,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {1150#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1157#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:01,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {1157#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1157#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:01,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {1157#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1164#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:01,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {1164#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1164#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:01,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {1164#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1171#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:01,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {1171#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1124#false} is VALID [2018-11-23 09:55:01,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {1124#false} havoc ~i~0;~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 09:55:01,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {1124#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1124#false} is VALID [2018-11-23 09:55:01,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {1124#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1124#false} is VALID [2018-11-23 09:55:01,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 09:55:01,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {1124#false} ~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 09:55:01,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {1124#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1124#false} is VALID [2018-11-23 09:55:01,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {1124#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1124#false} is VALID [2018-11-23 09:55:01,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 09:55:01,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {1124#false} ~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 09:55:01,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {1124#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1124#false} is VALID [2018-11-23 09:55:01,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {1124#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1124#false} is VALID [2018-11-23 09:55:01,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 09:55:01,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {1124#false} havoc ~x~0;~x~0 := 0bv32; {1124#false} is VALID [2018-11-23 09:55:01,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {1124#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1124#false} is VALID [2018-11-23 09:55:01,301 INFO L256 TraceCheckUtils]: 29: Hoare triple {1124#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {1124#false} is VALID [2018-11-23 09:55:01,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {1124#false} ~cond := #in~cond; {1124#false} is VALID [2018-11-23 09:55:01,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {1124#false} assume 0bv32 == ~cond; {1124#false} is VALID [2018-11-23 09:55:01,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2018-11-23 09:55:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 09:55:01,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:01,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2018-11-23 09:55:01,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {1124#false} assume 0bv32 == ~cond; {1124#false} is VALID [2018-11-23 09:55:01,660 INFO L273 TraceCheckUtils]: 30: Hoare triple {1124#false} ~cond := #in~cond; {1124#false} is VALID [2018-11-23 09:55:01,661 INFO L256 TraceCheckUtils]: 29: Hoare triple {1124#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {1124#false} is VALID [2018-11-23 09:55:01,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {1124#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1124#false} is VALID [2018-11-23 09:55:01,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {1124#false} havoc ~x~0;~x~0 := 0bv32; {1124#false} is VALID [2018-11-23 09:55:01,662 INFO L273 TraceCheckUtils]: 26: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 09:55:01,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {1124#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1124#false} is VALID [2018-11-23 09:55:01,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {1124#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1124#false} is VALID [2018-11-23 09:55:01,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {1124#false} ~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 09:55:01,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 09:55:01,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {1124#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1124#false} is VALID [2018-11-23 09:55:01,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {1124#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1124#false} is VALID [2018-11-23 09:55:01,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {1124#false} ~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 09:55:01,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 09:55:01,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {1124#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1124#false} is VALID [2018-11-23 09:55:01,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {1124#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1124#false} is VALID [2018-11-23 09:55:01,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {1124#false} havoc ~i~0;~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 09:55:01,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {1283#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1124#false} is VALID [2018-11-23 09:55:01,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {1287#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1283#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:01,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {1287#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1287#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {1294#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1287#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {1294#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1294#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {1301#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1294#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {1301#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1301#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {1308#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1301#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {1308#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1308#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {1123#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);havoc ~a~0;~a~0 := 0bv32; {1308#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret12 := main(); {1123#true} is VALID [2018-11-23 09:55:01,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #91#return; {1123#true} is VALID [2018-11-23 09:55:01,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-23 09:55:01,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {1123#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1123#true} is VALID [2018-11-23 09:55:01,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1123#true} is VALID [2018-11-23 09:55:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 09:55:01,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:01,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:55:01,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-23 09:55:01,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:01,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:55:01,816 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 09:55:01,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:55:01,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:55:01,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:55:01,817 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 12 states. [2018-11-23 09:55:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,892 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2018-11-23 09:55:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:55:02,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-23 09:55:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2018-11-23 09:55:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2018-11-23 09:55:02,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 80 transitions. [2018-11-23 09:55:03,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:03,076 INFO L225 Difference]: With dead ends: 73 [2018-11-23 09:55:03,076 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 09:55:03,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:55:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 09:55:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 09:55:03,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:03,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 09:55:03,114 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 09:55:03,114 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 09:55:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:03,116 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 09:55:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 09:55:03,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:03,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:03,117 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 09:55:03,118 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 09:55:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:03,121 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 09:55:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 09:55:03,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:03,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:03,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:03,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 09:55:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 09:55:03,125 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 33 [2018-11-23 09:55:03,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:03,125 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 09:55:03,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:55:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 09:55:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 09:55:03,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:03,127 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] [2018-11-23 09:55:03,127 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:03,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash 732981844, now seen corresponding path program 2 times [2018-11-23 09:55:03,128 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:03,128 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 09:55:03,158 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:03,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:55:03,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:03,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:03,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1620#true} is VALID [2018-11-23 09:55:03,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {1620#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1620#true} is VALID [2018-11-23 09:55:03,746 INFO L273 TraceCheckUtils]: 2: Hoare triple {1620#true} assume true; {1620#true} is VALID [2018-11-23 09:55:03,746 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1620#true} {1620#true} #91#return; {1620#true} is VALID [2018-11-23 09:55:03,746 INFO L256 TraceCheckUtils]: 4: Hoare triple {1620#true} call #t~ret12 := main(); {1620#true} is VALID [2018-11-23 09:55:03,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {1620#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);havoc ~a~0;~a~0 := 0bv32; {1640#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:03,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {1640#(= 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1640#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:03,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {1640#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1647#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:03,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {1647#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1647#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:03,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {1647#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1654#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:03,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1654#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:03,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {1654#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1661#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:03,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {1661#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1661#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:03,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {1661#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1668#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:03,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {1668#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1668#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:03,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {1668#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1675#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:03,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {1675#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1675#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:03,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {1675#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1682#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:03,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {1682#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1682#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:03,766 INFO L273 TraceCheckUtils]: 19: Hoare triple {1682#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1689#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:03,766 INFO L273 TraceCheckUtils]: 20: Hoare triple {1689#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1689#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:03,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {1689#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1696#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:03,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {1696#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1696#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:03,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {1696#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1703#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:03,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {1703#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1703#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:03,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {1703#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1710#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:03,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {1710#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1621#false} is VALID [2018-11-23 09:55:03,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {1621#false} havoc ~i~0;~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {1621#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1621#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {1621#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1621#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {1621#false} ~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {1621#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1621#false} is VALID [2018-11-23 09:55:03,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {1621#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1621#false} is VALID [2018-11-23 09:55:03,775 INFO L273 TraceCheckUtils]: 34: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 09:55:03,775 INFO L273 TraceCheckUtils]: 35: Hoare triple {1621#false} ~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 09:55:03,776 INFO L273 TraceCheckUtils]: 36: Hoare triple {1621#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1621#false} is VALID [2018-11-23 09:55:03,776 INFO L273 TraceCheckUtils]: 37: Hoare triple {1621#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1621#false} is VALID [2018-11-23 09:55:03,776 INFO L273 TraceCheckUtils]: 38: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 09:55:03,777 INFO L273 TraceCheckUtils]: 39: Hoare triple {1621#false} havoc ~x~0;~x~0 := 0bv32; {1621#false} is VALID [2018-11-23 09:55:03,777 INFO L273 TraceCheckUtils]: 40: Hoare triple {1621#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1621#false} is VALID [2018-11-23 09:55:03,777 INFO L256 TraceCheckUtils]: 41: Hoare triple {1621#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {1621#false} is VALID [2018-11-23 09:55:03,777 INFO L273 TraceCheckUtils]: 42: Hoare triple {1621#false} ~cond := #in~cond; {1621#false} is VALID [2018-11-23 09:55:03,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {1621#false} assume 0bv32 == ~cond; {1621#false} is VALID [2018-11-23 09:55:03,778 INFO L273 TraceCheckUtils]: 44: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2018-11-23 09:55:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 09:55:03,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:04,577 INFO L273 TraceCheckUtils]: 44: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2018-11-23 09:55:04,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {1621#false} assume 0bv32 == ~cond; {1621#false} is VALID [2018-11-23 09:55:04,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {1621#false} ~cond := #in~cond; {1621#false} is VALID [2018-11-23 09:55:04,578 INFO L256 TraceCheckUtils]: 41: Hoare triple {1621#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {1621#false} is VALID [2018-11-23 09:55:04,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {1621#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1621#false} is VALID [2018-11-23 09:55:04,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {1621#false} havoc ~x~0;~x~0 := 0bv32; {1621#false} is VALID [2018-11-23 09:55:04,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 09:55:04,579 INFO L273 TraceCheckUtils]: 37: Hoare triple {1621#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1621#false} is VALID [2018-11-23 09:55:04,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {1621#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1621#false} is VALID [2018-11-23 09:55:04,580 INFO L273 TraceCheckUtils]: 35: Hoare triple {1621#false} ~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 09:55:04,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 09:55:04,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {1621#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1621#false} is VALID [2018-11-23 09:55:04,581 INFO L273 TraceCheckUtils]: 32: Hoare triple {1621#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1621#false} is VALID [2018-11-23 09:55:04,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {1621#false} ~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 09:55:04,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 09:55:04,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {1621#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1621#false} is VALID [2018-11-23 09:55:04,581 INFO L273 TraceCheckUtils]: 28: Hoare triple {1621#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1621#false} is VALID [2018-11-23 09:55:04,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {1621#false} havoc ~i~0;~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 09:55:04,582 INFO L273 TraceCheckUtils]: 26: Hoare triple {1822#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1621#false} is VALID [2018-11-23 09:55:04,583 INFO L273 TraceCheckUtils]: 25: Hoare triple {1826#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1822#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:04,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {1826#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1826#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {1833#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1826#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {1833#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1833#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {1840#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1833#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,601 INFO L273 TraceCheckUtils]: 20: Hoare triple {1840#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1840#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {1847#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1840#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {1847#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1847#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {1854#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1847#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {1854#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1854#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {1861#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1854#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {1861#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1861#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {1868#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1861#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {1868#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1868#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {1875#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1868#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {1875#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1875#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {1882#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1875#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {1882#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1882#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {1889#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1882#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {1889#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1889#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {1620#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);havoc ~a~0;~a~0 := 0bv32; {1889#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {1620#true} call #t~ret12 := main(); {1620#true} is VALID [2018-11-23 09:55:04,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1620#true} {1620#true} #91#return; {1620#true} is VALID [2018-11-23 09:55:04,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {1620#true} assume true; {1620#true} is VALID [2018-11-23 09:55:04,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {1620#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1620#true} is VALID [2018-11-23 09:55:04,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1620#true} is VALID [2018-11-23 09:55:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 09:55:04,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:04,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:55:04,660 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 09:55:04,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:04,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:55:04,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:04,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:55:04,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:55:04,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:55:04,851 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 24 states. [2018-11-23 09:55:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,382 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2018-11-23 09:55:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:55:09,382 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 09:55:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 110 transitions. [2018-11-23 09:55:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 110 transitions. [2018-11-23 09:55:09,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 110 transitions. [2018-11-23 09:55:09,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:09,597 INFO L225 Difference]: With dead ends: 97 [2018-11-23 09:55:09,597 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 09:55:09,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 09:55:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 09:55:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 09:55:09,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:09,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-23 09:55:09,626 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 09:55:09,627 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 09:55:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,630 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 09:55:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 09:55:09,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:09,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:09,631 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 09:55:09,631 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 09:55:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,634 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 09:55:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 09:55:09,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:09,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:09,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:09,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 09:55:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-23 09:55:09,639 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 45 [2018-11-23 09:55:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:09,639 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-23 09:55:09,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:55:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 09:55:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 09:55:09,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:09,641 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] [2018-11-23 09:55:09,642 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:09,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:09,642 INFO L82 PathProgramCache]: Analyzing trace with hash 956234428, now seen corresponding path program 3 times [2018-11-23 09:55:09,642 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:09,643 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 09:55:09,664 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:55:09,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 09:55:09,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:09,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:09,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {2333#true} call ULTIMATE.init(); {2333#true} is VALID [2018-11-23 09:55:09,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {2333#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2333#true} is VALID [2018-11-23 09:55:09,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {2333#true} assume true; {2333#true} is VALID [2018-11-23 09:55:09,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2333#true} {2333#true} #91#return; {2333#true} is VALID [2018-11-23 09:55:09,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {2333#true} call #t~ret12 := main(); {2333#true} is VALID [2018-11-23 09:55:09,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {2333#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);havoc ~a~0;~a~0 := 0bv32; {2333#true} is VALID [2018-11-23 09:55:09,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,856 INFO L273 TraceCheckUtils]: 19: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,856 INFO L273 TraceCheckUtils]: 20: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,856 INFO L273 TraceCheckUtils]: 21: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,856 INFO L273 TraceCheckUtils]: 22: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,857 INFO L273 TraceCheckUtils]: 28: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,858 INFO L273 TraceCheckUtils]: 34: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,858 INFO L273 TraceCheckUtils]: 35: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,859 INFO L273 TraceCheckUtils]: 36: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,859 INFO L273 TraceCheckUtils]: 39: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,860 INFO L273 TraceCheckUtils]: 41: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,861 INFO L273 TraceCheckUtils]: 48: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {2333#true} assume !~bvslt32(~a~0, 100000bv32); {2333#true} is VALID [2018-11-23 09:55:09,862 INFO L273 TraceCheckUtils]: 51: Hoare triple {2333#true} havoc ~i~0;~i~0 := 0bv32; {2491#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:09,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {2491#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2491#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:09,862 INFO L273 TraceCheckUtils]: 53: Hoare triple {2491#(= main_~i~0 (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2498#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,863 INFO L273 TraceCheckUtils]: 54: Hoare triple {2498#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 09:55:09,863 INFO L273 TraceCheckUtils]: 55: Hoare triple {2334#false} ~i~0 := 0bv32; {2334#false} is VALID [2018-11-23 09:55:09,863 INFO L273 TraceCheckUtils]: 56: Hoare triple {2334#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2334#false} is VALID [2018-11-23 09:55:09,863 INFO L273 TraceCheckUtils]: 57: Hoare triple {2334#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2334#false} is VALID [2018-11-23 09:55:09,864 INFO L273 TraceCheckUtils]: 58: Hoare triple {2334#false} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 09:55:09,864 INFO L273 TraceCheckUtils]: 59: Hoare triple {2334#false} ~i~0 := 0bv32; {2334#false} is VALID [2018-11-23 09:55:09,864 INFO L273 TraceCheckUtils]: 60: Hoare triple {2334#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {2334#false} is VALID [2018-11-23 09:55:09,864 INFO L273 TraceCheckUtils]: 61: Hoare triple {2334#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2334#false} is VALID [2018-11-23 09:55:09,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {2334#false} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 09:55:09,864 INFO L273 TraceCheckUtils]: 63: Hoare triple {2334#false} havoc ~x~0;~x~0 := 0bv32; {2334#false} is VALID [2018-11-23 09:55:09,865 INFO L273 TraceCheckUtils]: 64: Hoare triple {2334#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2334#false} is VALID [2018-11-23 09:55:09,865 INFO L256 TraceCheckUtils]: 65: Hoare triple {2334#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {2334#false} is VALID [2018-11-23 09:55:09,865 INFO L273 TraceCheckUtils]: 66: Hoare triple {2334#false} ~cond := #in~cond; {2334#false} is VALID [2018-11-23 09:55:09,865 INFO L273 TraceCheckUtils]: 67: Hoare triple {2334#false} assume 0bv32 == ~cond; {2334#false} is VALID [2018-11-23 09:55:09,866 INFO L273 TraceCheckUtils]: 68: Hoare triple {2334#false} assume !false; {2334#false} is VALID [2018-11-23 09:55:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-11-23 09:55:09,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:09,964 INFO L273 TraceCheckUtils]: 68: Hoare triple {2334#false} assume !false; {2334#false} is VALID [2018-11-23 09:55:09,965 INFO L273 TraceCheckUtils]: 67: Hoare triple {2334#false} assume 0bv32 == ~cond; {2334#false} is VALID [2018-11-23 09:55:09,965 INFO L273 TraceCheckUtils]: 66: Hoare triple {2334#false} ~cond := #in~cond; {2334#false} is VALID [2018-11-23 09:55:09,965 INFO L256 TraceCheckUtils]: 65: Hoare triple {2334#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {2334#false} is VALID [2018-11-23 09:55:09,966 INFO L273 TraceCheckUtils]: 64: Hoare triple {2334#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2334#false} is VALID [2018-11-23 09:55:09,966 INFO L273 TraceCheckUtils]: 63: Hoare triple {2334#false} havoc ~x~0;~x~0 := 0bv32; {2334#false} is VALID [2018-11-23 09:55:09,966 INFO L273 TraceCheckUtils]: 62: Hoare triple {2334#false} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 09:55:09,966 INFO L273 TraceCheckUtils]: 61: Hoare triple {2334#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2334#false} is VALID [2018-11-23 09:55:09,967 INFO L273 TraceCheckUtils]: 60: Hoare triple {2334#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {2334#false} is VALID [2018-11-23 09:55:09,967 INFO L273 TraceCheckUtils]: 59: Hoare triple {2334#false} ~i~0 := 0bv32; {2334#false} is VALID [2018-11-23 09:55:09,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {2334#false} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 09:55:09,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {2334#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2334#false} is VALID [2018-11-23 09:55:09,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {2334#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2334#false} is VALID [2018-11-23 09:55:09,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {2334#false} ~i~0 := 0bv32; {2334#false} is VALID [2018-11-23 09:55:09,969 INFO L273 TraceCheckUtils]: 54: Hoare triple {2586#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 09:55:09,969 INFO L273 TraceCheckUtils]: 53: Hoare triple {2590#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2586#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:09,970 INFO L273 TraceCheckUtils]: 52: Hoare triple {2590#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2590#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:09,976 INFO L273 TraceCheckUtils]: 51: Hoare triple {2333#true} havoc ~i~0;~i~0 := 0bv32; {2590#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:09,977 INFO L273 TraceCheckUtils]: 50: Hoare triple {2333#true} assume !~bvslt32(~a~0, 100000bv32); {2333#true} is VALID [2018-11-23 09:55:09,977 INFO L273 TraceCheckUtils]: 49: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,977 INFO L273 TraceCheckUtils]: 48: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,977 INFO L273 TraceCheckUtils]: 47: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,977 INFO L273 TraceCheckUtils]: 46: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,978 INFO L273 TraceCheckUtils]: 45: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,978 INFO L273 TraceCheckUtils]: 43: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,979 INFO L273 TraceCheckUtils]: 40: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,979 INFO L273 TraceCheckUtils]: 39: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,979 INFO L273 TraceCheckUtils]: 38: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,979 INFO L273 TraceCheckUtils]: 37: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,980 INFO L273 TraceCheckUtils]: 31: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,980 INFO L273 TraceCheckUtils]: 29: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,982 INFO L273 TraceCheckUtils]: 19: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,982 INFO L273 TraceCheckUtils]: 18: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 09:55:09,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {2333#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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#true} is VALID [2018-11-23 09:55:09,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {2333#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);havoc ~a~0;~a~0 := 0bv32; {2333#true} is VALID [2018-11-23 09:55:09,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {2333#true} call #t~ret12 := main(); {2333#true} is VALID [2018-11-23 09:55:09,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2333#true} {2333#true} #91#return; {2333#true} is VALID [2018-11-23 09:55:09,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {2333#true} assume true; {2333#true} is VALID [2018-11-23 09:55:09,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {2333#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2333#true} is VALID [2018-11-23 09:55:09,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {2333#true} call ULTIMATE.init(); {2333#true} is VALID [2018-11-23 09:55:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-11-23 09:55:09,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:09,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:55:09,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 09:55:09,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:09,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:55:10,038 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 09:55:10,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:55:10,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:55:10,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:55:10,039 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2018-11-23 09:55:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,450 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-23 09:55:10,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:10,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 09:55:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 09:55:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 09:55:10,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 09:55:10,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:10,571 INFO L225 Difference]: With dead ends: 111 [2018-11-23 09:55:10,572 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 09:55:10,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 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 09:55:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 09:55:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 09:55:10,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:10,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-23 09:55:10,632 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 09:55:10,632 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 09:55:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,635 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 09:55:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 09:55:10,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:10,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:10,636 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 09:55:10,637 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 09:55:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:10,640 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 09:55:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 09:55:10,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:10,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:10,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:10,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 09:55:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-23 09:55:10,645 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 69 [2018-11-23 09:55:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:10,645 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-23 09:55:10,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 09:55:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 09:55:10,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:10,647 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 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] [2018-11-23 09:55:10,647 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:10,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash 109795786, now seen corresponding path program 4 times [2018-11-23 09:55:10,648 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:10,648 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 09:55:10,668 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:55:10,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:55:10,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:10,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:11,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {3238#true} call ULTIMATE.init(); {3238#true} is VALID [2018-11-23 09:55:11,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {3238#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3238#true} is VALID [2018-11-23 09:55:11,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {3238#true} assume true; {3238#true} is VALID [2018-11-23 09:55:11,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3238#true} {3238#true} #91#return; {3238#true} is VALID [2018-11-23 09:55:11,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {3238#true} call #t~ret12 := main(); {3238#true} is VALID [2018-11-23 09:55:11,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {3238#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);havoc ~a~0;~a~0 := 0bv32; {3258#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:11,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {3258#(= 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3258#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:11,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {3258#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3265#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:11,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {3265#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3265#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:11,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {3265#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3272#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:11,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {3272#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3272#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:11,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {3272#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3279#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:11,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {3279#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3279#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:11,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {3279#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3286#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:11,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {3286#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3286#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:11,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {3286#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:11,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {3293#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:11,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {3293#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3300#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:11,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {3300#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3300#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:11,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {3300#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3307#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:11,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {3307#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3307#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:11,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {3307#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3314#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:11,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {3314#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3314#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:11,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {3314#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3321#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:11,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {3321#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3321#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:11,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {3321#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3328#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:11,364 INFO L273 TraceCheckUtils]: 26: Hoare triple {3328#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3328#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:11,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {3328#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3335#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 09:55:11,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {3335#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3335#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 09:55:11,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {3335#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3342#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 09:55:11,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {3342#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3342#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 09:55:11,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {3342#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3349#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 09:55:11,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {3349#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3349#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 09:55:11,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {3349#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3356#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 09:55:11,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {3356#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3356#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 09:55:11,369 INFO L273 TraceCheckUtils]: 35: Hoare triple {3356#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3363#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 09:55:11,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {3363#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3363#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 09:55:11,370 INFO L273 TraceCheckUtils]: 37: Hoare triple {3363#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3370#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 09:55:11,371 INFO L273 TraceCheckUtils]: 38: Hoare triple {3370#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3370#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 09:55:11,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {3370#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3377#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 09:55:11,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {3377#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3377#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 09:55:11,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {3377#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3384#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 09:55:11,373 INFO L273 TraceCheckUtils]: 42: Hoare triple {3384#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3384#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 09:55:11,374 INFO L273 TraceCheckUtils]: 43: Hoare triple {3384#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3391#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 09:55:11,396 INFO L273 TraceCheckUtils]: 44: Hoare triple {3391#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3391#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 09:55:11,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {3391#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3398#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 09:55:11,420 INFO L273 TraceCheckUtils]: 46: Hoare triple {3398#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3398#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 09:55:11,424 INFO L273 TraceCheckUtils]: 47: Hoare triple {3398#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 09:55:11,424 INFO L273 TraceCheckUtils]: 48: Hoare triple {3405#(= (_ 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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3405#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 09:55:11,429 INFO L273 TraceCheckUtils]: 49: Hoare triple {3405#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3412#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 09:55:11,429 INFO L273 TraceCheckUtils]: 50: Hoare triple {3412#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {3239#false} is VALID [2018-11-23 09:55:11,429 INFO L273 TraceCheckUtils]: 51: Hoare triple {3239#false} havoc ~i~0;~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 09:55:11,429 INFO L273 TraceCheckUtils]: 52: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3239#false} is VALID [2018-11-23 09:55:11,430 INFO L273 TraceCheckUtils]: 53: Hoare triple {3239#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3239#false} is VALID [2018-11-23 09:55:11,430 INFO L273 TraceCheckUtils]: 54: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3239#false} is VALID [2018-11-23 09:55:11,430 INFO L273 TraceCheckUtils]: 55: Hoare triple {3239#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3239#false} is VALID [2018-11-23 09:55:11,430 INFO L273 TraceCheckUtils]: 56: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3239#false} is VALID [2018-11-23 09:55:11,430 INFO L273 TraceCheckUtils]: 57: Hoare triple {3239#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3239#false} is VALID [2018-11-23 09:55:11,431 INFO L273 TraceCheckUtils]: 58: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3239#false} is VALID [2018-11-23 09:55:11,431 INFO L273 TraceCheckUtils]: 59: Hoare triple {3239#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3239#false} is VALID [2018-11-23 09:55:11,431 INFO L273 TraceCheckUtils]: 60: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 09:55:11,431 INFO L273 TraceCheckUtils]: 61: Hoare triple {3239#false} ~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 09:55:11,431 INFO L273 TraceCheckUtils]: 62: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3239#false} is VALID [2018-11-23 09:55:11,432 INFO L273 TraceCheckUtils]: 63: Hoare triple {3239#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3239#false} is VALID [2018-11-23 09:55:11,432 INFO L273 TraceCheckUtils]: 64: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3239#false} is VALID [2018-11-23 09:55:11,432 INFO L273 TraceCheckUtils]: 65: Hoare triple {3239#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3239#false} is VALID [2018-11-23 09:55:11,432 INFO L273 TraceCheckUtils]: 66: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3239#false} is VALID [2018-11-23 09:55:11,432 INFO L273 TraceCheckUtils]: 67: Hoare triple {3239#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3239#false} is VALID [2018-11-23 09:55:11,432 INFO L273 TraceCheckUtils]: 68: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3239#false} is VALID [2018-11-23 09:55:11,433 INFO L273 TraceCheckUtils]: 69: Hoare triple {3239#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3239#false} is VALID [2018-11-23 09:55:11,433 INFO L273 TraceCheckUtils]: 70: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 09:55:11,433 INFO L273 TraceCheckUtils]: 71: Hoare triple {3239#false} ~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 09:55:11,433 INFO L273 TraceCheckUtils]: 72: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3239#false} is VALID [2018-11-23 09:55:11,433 INFO L273 TraceCheckUtils]: 73: Hoare triple {3239#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3239#false} is VALID [2018-11-23 09:55:11,434 INFO L273 TraceCheckUtils]: 74: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3239#false} is VALID [2018-11-23 09:55:11,434 INFO L273 TraceCheckUtils]: 75: Hoare triple {3239#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3239#false} is VALID [2018-11-23 09:55:11,434 INFO L273 TraceCheckUtils]: 76: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3239#false} is VALID [2018-11-23 09:55:11,434 INFO L273 TraceCheckUtils]: 77: Hoare triple {3239#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3239#false} is VALID [2018-11-23 09:55:11,434 INFO L273 TraceCheckUtils]: 78: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3239#false} is VALID [2018-11-23 09:55:11,434 INFO L273 TraceCheckUtils]: 79: Hoare triple {3239#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3239#false} is VALID [2018-11-23 09:55:11,435 INFO L273 TraceCheckUtils]: 80: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 09:55:11,435 INFO L273 TraceCheckUtils]: 81: Hoare triple {3239#false} havoc ~x~0;~x~0 := 0bv32; {3239#false} is VALID [2018-11-23 09:55:11,435 INFO L273 TraceCheckUtils]: 82: Hoare triple {3239#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3239#false} is VALID [2018-11-23 09:55:11,435 INFO L256 TraceCheckUtils]: 83: Hoare triple {3239#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {3239#false} is VALID [2018-11-23 09:55:11,435 INFO L273 TraceCheckUtils]: 84: Hoare triple {3239#false} ~cond := #in~cond; {3239#false} is VALID [2018-11-23 09:55:11,436 INFO L273 TraceCheckUtils]: 85: Hoare triple {3239#false} assume 0bv32 == ~cond; {3239#false} is VALID [2018-11-23 09:55:11,436 INFO L273 TraceCheckUtils]: 86: Hoare triple {3239#false} assume !false; {3239#false} is VALID [2018-11-23 09:55:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 09:55:11,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:13,509 INFO L273 TraceCheckUtils]: 86: Hoare triple {3239#false} assume !false; {3239#false} is VALID [2018-11-23 09:55:13,509 INFO L273 TraceCheckUtils]: 85: Hoare triple {3239#false} assume 0bv32 == ~cond; {3239#false} is VALID [2018-11-23 09:55:13,509 INFO L273 TraceCheckUtils]: 84: Hoare triple {3239#false} ~cond := #in~cond; {3239#false} is VALID [2018-11-23 09:55:13,509 INFO L256 TraceCheckUtils]: 83: Hoare triple {3239#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1bv32 else 0bv32)); {3239#false} is VALID [2018-11-23 09:55:13,509 INFO L273 TraceCheckUtils]: 82: Hoare triple {3239#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem11 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3239#false} is VALID [2018-11-23 09:55:13,509 INFO L273 TraceCheckUtils]: 81: Hoare triple {3239#false} havoc ~x~0;~x~0 := 0bv32; {3239#false} is VALID [2018-11-23 09:55:13,510 INFO L273 TraceCheckUtils]: 80: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 09:55:13,510 INFO L273 TraceCheckUtils]: 79: Hoare triple {3239#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3239#false} is VALID [2018-11-23 09:55:13,510 INFO L273 TraceCheckUtils]: 78: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3239#false} is VALID [2018-11-23 09:55:13,510 INFO L273 TraceCheckUtils]: 77: Hoare triple {3239#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3239#false} is VALID [2018-11-23 09:55:13,510 INFO L273 TraceCheckUtils]: 76: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3239#false} is VALID [2018-11-23 09:55:13,510 INFO L273 TraceCheckUtils]: 75: Hoare triple {3239#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3239#false} is VALID [2018-11-23 09:55:13,510 INFO L273 TraceCheckUtils]: 74: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3239#false} is VALID [2018-11-23 09:55:13,510 INFO L273 TraceCheckUtils]: 73: Hoare triple {3239#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3239#false} is VALID [2018-11-23 09:55:13,511 INFO L273 TraceCheckUtils]: 72: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3239#false} is VALID [2018-11-23 09:55:13,511 INFO L273 TraceCheckUtils]: 71: Hoare triple {3239#false} ~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 09:55:13,511 INFO L273 TraceCheckUtils]: 70: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 09:55:13,511 INFO L273 TraceCheckUtils]: 69: Hoare triple {3239#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3239#false} is VALID [2018-11-23 09:55:13,511 INFO L273 TraceCheckUtils]: 68: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3239#false} is VALID [2018-11-23 09:55:13,511 INFO L273 TraceCheckUtils]: 67: Hoare triple {3239#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3239#false} is VALID [2018-11-23 09:55:13,511 INFO L273 TraceCheckUtils]: 66: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3239#false} is VALID [2018-11-23 09:55:13,512 INFO L273 TraceCheckUtils]: 65: Hoare triple {3239#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3239#false} is VALID [2018-11-23 09:55:13,512 INFO L273 TraceCheckUtils]: 64: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3239#false} is VALID [2018-11-23 09:55:13,512 INFO L273 TraceCheckUtils]: 63: Hoare triple {3239#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3239#false} is VALID [2018-11-23 09:55:13,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3239#false} is VALID [2018-11-23 09:55:13,513 INFO L273 TraceCheckUtils]: 61: Hoare triple {3239#false} ~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 09:55:13,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 09:55:13,513 INFO L273 TraceCheckUtils]: 59: Hoare triple {3239#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3239#false} is VALID [2018-11-23 09:55:13,513 INFO L273 TraceCheckUtils]: 58: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3239#false} is VALID [2018-11-23 09:55:13,513 INFO L273 TraceCheckUtils]: 57: Hoare triple {3239#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3239#false} is VALID [2018-11-23 09:55:13,513 INFO L273 TraceCheckUtils]: 56: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3239#false} is VALID [2018-11-23 09:55:13,514 INFO L273 TraceCheckUtils]: 55: Hoare triple {3239#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3239#false} is VALID [2018-11-23 09:55:13,514 INFO L273 TraceCheckUtils]: 54: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3239#false} is VALID [2018-11-23 09:55:13,514 INFO L273 TraceCheckUtils]: 53: Hoare triple {3239#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3239#false} is VALID [2018-11-23 09:55:13,514 INFO L273 TraceCheckUtils]: 52: Hoare triple {3239#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3239#false} is VALID [2018-11-23 09:55:13,514 INFO L273 TraceCheckUtils]: 51: Hoare triple {3239#false} havoc ~i~0;~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 09:55:13,529 INFO L273 TraceCheckUtils]: 50: Hoare triple {3632#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {3239#false} is VALID [2018-11-23 09:55:13,531 INFO L273 TraceCheckUtils]: 49: Hoare triple {3636#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3632#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:13,531 INFO L273 TraceCheckUtils]: 48: Hoare triple {3636#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3636#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,537 INFO L273 TraceCheckUtils]: 47: Hoare triple {3643#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3636#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,537 INFO L273 TraceCheckUtils]: 46: Hoare triple {3643#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3643#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,542 INFO L273 TraceCheckUtils]: 45: Hoare triple {3650#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3643#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,542 INFO L273 TraceCheckUtils]: 44: Hoare triple {3650#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3650#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,546 INFO L273 TraceCheckUtils]: 43: Hoare triple {3657#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3650#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,547 INFO L273 TraceCheckUtils]: 42: Hoare triple {3657#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3657#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,551 INFO L273 TraceCheckUtils]: 41: Hoare triple {3664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3657#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {3664#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {3671#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,556 INFO L273 TraceCheckUtils]: 38: Hoare triple {3671#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3671#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,562 INFO L273 TraceCheckUtils]: 37: Hoare triple {3678#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3671#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {3678#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3678#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,568 INFO L273 TraceCheckUtils]: 35: Hoare triple {3685#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3678#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,568 INFO L273 TraceCheckUtils]: 34: Hoare triple {3685#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3685#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {3692#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3685#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {3692#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3692#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,579 INFO L273 TraceCheckUtils]: 31: Hoare triple {3699#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3692#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {3699#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3699#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {3706#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3699#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3706#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {3713#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3706#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {3713#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3713#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,598 INFO L273 TraceCheckUtils]: 25: Hoare triple {3720#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3713#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {3720#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3720#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {3727#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3720#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,603 INFO L273 TraceCheckUtils]: 22: Hoare triple {3727#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3727#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {3734#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3727#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {3734#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3734#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {3741#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3734#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {3741#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3741#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {3748#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3741#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {3748#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3748#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {3755#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3748#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,625 INFO L273 TraceCheckUtils]: 14: Hoare triple {3755#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3755#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {3762#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3755#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {3762#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3762#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {3769#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3762#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {3769#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3769#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {3776#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3769#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {3776#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3776#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {3783#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {3783#(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;call write~intINTTYPE4(#t~nondet2, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3783#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {3238#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);havoc ~a~0;~a~0 := 0bv32; {3783#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {3238#true} call #t~ret12 := main(); {3238#true} is VALID [2018-11-23 09:55:13,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3238#true} {3238#true} #91#return; {3238#true} is VALID [2018-11-23 09:55:13,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {3238#true} assume true; {3238#true} is VALID [2018-11-23 09:55:13,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {3238#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3238#true} is VALID [2018-11-23 09:55:13,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {3238#true} call ULTIMATE.init(); {3238#true} is VALID [2018-11-23 09:55:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 09:55:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:55:13,673 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 87 [2018-11-23 09:55:13,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:13,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:55:14,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:14,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:55:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:55:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:55:14,034 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 48 states. [2018-11-23 09:55:22,241 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:55:22,715 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:55:23,241 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:55:23,765 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:55:24,329 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:55:24,920 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:55:26,093 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 09:55:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:33,353 INFO L93 Difference]: Finished difference Result 181 states and 212 transitions. [2018-11-23 09:55:33,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:55:33,354 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 87 [2018-11-23 09:55:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:55:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 170 transitions. [2018-11-23 09:55:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:55:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 170 transitions. [2018-11-23 09:55:33,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 170 transitions. [2018-11-23 09:55:33,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:33,829 INFO L225 Difference]: With dead ends: 181 [2018-11-23 09:55:33,829 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 09:55:33,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:55:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 09:55:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-23 09:55:34,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:34,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 140 states. [2018-11-23 09:55:34,037 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 140 states. [2018-11-23 09:55:34,037 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 140 states. [2018-11-23 09:55:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:34,042 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-11-23 09:55:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-23 09:55:34,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:34,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:34,043 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 140 states. [2018-11-23 09:55:34,043 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 140 states. [2018-11-23 09:55:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:34,048 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-11-23 09:55:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-23 09:55:34,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:34,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:34,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:34,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 09:55:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-11-23 09:55:34,054 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 87 [2018-11-23 09:55:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:34,054 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-11-23 09:55:34,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:55:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-23 09:55:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-23 09:55:34,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:34,056 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 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] [2018-11-23 09:55:34,056 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:34,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash 557825690, now seen corresponding path program 5 times [2018-11-23 09:55:34,058 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:34,058 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 09:55:34,086 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1