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_copy4_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:29,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:29,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:29,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:29,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:29,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:29,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:29,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:29,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:29,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:29,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:29,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:29,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:29,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:29,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:29,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:29,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:29,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:29,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:29,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:29,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:29,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:29,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:29,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:29,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:29,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:29,504 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:29,504 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:29,505 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:29,508 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:29,508 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:29,509 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:29,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:29,510 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:29,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:29,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:29,514 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:02:29,540 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:29,540 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:29,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:29,542 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:29,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:29,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:29,543 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:29,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:29,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:29,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:29,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:29,544 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:29,545 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:29,545 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:29,545 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:29,545 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:29,545 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:29,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:29,547 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:29,547 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:29,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:29,548 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:29,548 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:29,548 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:29,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:29,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:29,549 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:29,549 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:29,549 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:29,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:29,550 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:29,550 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:29,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:29,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:29,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:29,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:29,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:29,646 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:29,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-23 10:02:29,704 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f099c794/a390945eb40a4419817e1c8dc0ebde91/FLAG52fa91953 [2018-11-23 10:02:30,123 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:30,125 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-23 10:02:30,133 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f099c794/a390945eb40a4419817e1c8dc0ebde91/FLAG52fa91953 [2018-11-23 10:02:30,496 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f099c794/a390945eb40a4419817e1c8dc0ebde91 [2018-11-23 10:02:30,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:30,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:30,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:30,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:30,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:30,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703a52da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30, skipping insertion in model container [2018-11-23 10:02:30,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:30,549 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:30,791 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:30,796 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:30,826 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:30,851 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:30,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30 WrapperNode [2018-11-23 10:02:30,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:30,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:30,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:30,853 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:30,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:30,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:30,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:30,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:30,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:30,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:30,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:30,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:30,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:31,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:31,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:31,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:31,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:31,966 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:31,967 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 10:02:31,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:31 BoogieIcfgContainer [2018-11-23 10:02:31,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:31,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:31,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:31,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:31,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:30" (1/3) ... [2018-11-23 10:02:31,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7b1295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:31, skipping insertion in model container [2018-11-23 10:02:31,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (2/3) ... [2018-11-23 10:02:31,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7b1295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:31, skipping insertion in model container [2018-11-23 10:02:31,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:31" (3/3) ... [2018-11-23 10:02:31,977 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy4_true-unreach-call_ground.i [2018-11-23 10:02:31,987 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:31,997 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:32,016 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:32,050 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:32,051 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:32,051 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:32,051 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:32,052 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:32,052 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:32,052 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:32,052 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:32,052 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 10:02:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:02:32,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:32,078 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 10:02:32,081 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:32,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1010407240, now seen corresponding path program 1 times [2018-11-23 10:02:32,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:32,094 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:32,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:32,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 10:02:32,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {39#true} is VALID [2018-11-23 10:02:32,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 10:02:32,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-23 10:02:32,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret13 := main(); {39#true} is VALID [2018-11-23 10:02:32,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {39#true} is VALID [2018-11-23 10:02:32,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 10:02:32,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} havoc ~i~0;~i~0 := 0bv32; {40#false} is VALID [2018-11-23 10:02:32,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !~bvslt32(~i~0, 100000bv32); {40#false} is VALID [2018-11-23 10:02:32,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-23 10:02:32,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !~bvslt32(~i~0, 100000bv32); {40#false} is VALID [2018-11-23 10:02:32,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-23 10:02:32,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !~bvslt32(~i~0, 100000bv32); {40#false} is VALID [2018-11-23 10:02:32,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-23 10:02:32,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume !~bvslt32(~i~0, 100000bv32); {40#false} is VALID [2018-11-23 10:02:32,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} havoc ~x~0;~x~0 := 0bv32; {40#false} is VALID [2018-11-23 10:02:32,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {40#false} is VALID [2018-11-23 10:02:32,287 INFO L256 TraceCheckUtils]: 17: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {40#false} is VALID [2018-11-23 10:02:32,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 10:02:32,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {40#false} assume 0bv32 == ~cond; {40#false} is VALID [2018-11-23 10:02:32,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 10:02:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:32,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:02:32,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:32,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:32,306 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 10:02:32,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:32,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:32,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:32,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:32,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:32,418 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 10:02:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,648 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2018-11-23 10:02:32,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:32,648 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 10:02:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-23 10:02:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-23 10:02:32,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2018-11-23 10:02:32,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:32,906 INFO L225 Difference]: With dead ends: 64 [2018-11-23 10:02:32,906 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 10:02:32,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 10:02:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 10:02:32,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:32,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 10:02:32,975 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 10:02:32,976 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 10:02:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,981 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 10:02:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 10:02:32,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,982 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 10:02:32,982 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 10:02:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,987 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 10:02:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 10:02:32,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:32,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 10:02:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 10:02:32,994 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-11-23 10:02:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 10:02:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 10:02:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:02:32,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:32,996 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 10:02:32,997 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:32,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash 555030978, now seen corresponding path program 1 times [2018-11-23 10:02:32,998 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:32,998 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:33,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:33,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 10:02:33,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {291#true} is VALID [2018-11-23 10:02:33,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 10:02:33,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #105#return; {291#true} is VALID [2018-11-23 10:02:33,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret13 := main(); {291#true} is VALID [2018-11-23 10:02:33,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {311#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:33,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {292#false} is VALID [2018-11-23 10:02:33,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#false} havoc ~i~0;~i~0 := 0bv32; {292#false} is VALID [2018-11-23 10:02:33,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#false} assume !~bvslt32(~i~0, 100000bv32); {292#false} is VALID [2018-11-23 10:02:33,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0bv32; {292#false} is VALID [2018-11-23 10:02:33,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} assume !~bvslt32(~i~0, 100000bv32); {292#false} is VALID [2018-11-23 10:02:33,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} ~i~0 := 0bv32; {292#false} is VALID [2018-11-23 10:02:33,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {292#false} assume !~bvslt32(~i~0, 100000bv32); {292#false} is VALID [2018-11-23 10:02:33,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {292#false} ~i~0 := 0bv32; {292#false} is VALID [2018-11-23 10:02:33,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#false} assume !~bvslt32(~i~0, 100000bv32); {292#false} is VALID [2018-11-23 10:02:33,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#false} havoc ~x~0;~x~0 := 0bv32; {292#false} is VALID [2018-11-23 10:02:33,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {292#false} is VALID [2018-11-23 10:02:33,663 INFO L256 TraceCheckUtils]: 17: Hoare triple {292#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {292#false} is VALID [2018-11-23 10:02:33,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2018-11-23 10:02:33,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {292#false} assume 0bv32 == ~cond; {292#false} is VALID [2018-11-23 10:02:33,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 10:02:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:33,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:33,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:33,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:33,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:02:33,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:33,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:33,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:33,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:33,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:33,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:33,740 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-23 10:02:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,035 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 10:02:34,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:34,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:02:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 10:02:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 10:02:34,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 10:02:34,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,241 INFO L225 Difference]: With dead ends: 56 [2018-11-23 10:02:34,241 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 10:02:34,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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 10:02:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 10:02:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 10:02:34,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:34,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 10:02:34,266 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 10:02:34,266 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 10:02:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,270 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 10:02:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 10:02:34,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,271 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 10:02:34,271 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 10:02:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,274 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 10:02:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 10:02:34,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:34,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 10:02:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 10:02:34,278 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2018-11-23 10:02:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:34,279 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 10:02:34,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 10:02:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:02:34,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:34,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, 1, 1, 1, 1] [2018-11-23 10:02:34,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:34,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:34,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1099948320, now seen corresponding path program 1 times [2018-11-23 10:02:34,282 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:34,282 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:34,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:34,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {543#true} is VALID [2018-11-23 10:02:34,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {543#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {543#true} is VALID [2018-11-23 10:02:34,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2018-11-23 10:02:34,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #105#return; {543#true} is VALID [2018-11-23 10:02:34,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret13 := main(); {543#true} is VALID [2018-11-23 10:02:34,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {543#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {563#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:34,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {563#(= 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; {563#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:34,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {563#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {570#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:34,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {570#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {544#false} havoc ~i~0;~i~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {544#false} havoc ~x~0;~x~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {544#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {544#false} is VALID [2018-11-23 10:02:34,473 INFO L256 TraceCheckUtils]: 19: Hoare triple {544#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {544#false} is VALID [2018-11-23 10:02:34,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2018-11-23 10:02:34,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {544#false} assume 0bv32 == ~cond; {544#false} is VALID [2018-11-23 10:02:34,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {544#false} assume !false; {544#false} is VALID [2018-11-23 10:02:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:34,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:34,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {544#false} assume !false; {544#false} is VALID [2018-11-23 10:02:34,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {544#false} assume 0bv32 == ~cond; {544#false} is VALID [2018-11-23 10:02:34,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2018-11-23 10:02:34,615 INFO L256 TraceCheckUtils]: 19: Hoare triple {544#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {544#false} is VALID [2018-11-23 10:02:34,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {544#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {544#false} is VALID [2018-11-23 10:02:34,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {544#false} havoc ~x~0;~x~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {544#false} ~i~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {544#false} assume !~bvslt32(~i~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {544#false} havoc ~i~0;~i~0 := 0bv32; {544#false} is VALID [2018-11-23 10:02:34,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {658#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {544#false} is VALID [2018-11-23 10:02:34,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {662#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {658#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:34,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {662#(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; {662#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {543#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {662#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret13 := main(); {543#true} is VALID [2018-11-23 10:02:34,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #105#return; {543#true} is VALID [2018-11-23 10:02:34,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2018-11-23 10:02:34,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {543#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {543#true} is VALID [2018-11-23 10:02:34,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {543#true} is VALID [2018-11-23 10:02:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:34,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:34,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:34,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 10:02:34,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:34,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:34,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:34,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:34,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:34,700 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2018-11-23 10:02:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,004 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-23 10:02:35,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:35,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 10:02:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 10:02:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 10:02:35,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-23 10:02:35,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,187 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:02:35,188 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 10:02:35,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 10:02:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 10:02:35,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:35,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 10:02:35,201 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 10:02:35,201 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 10:02:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,205 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 10:02:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 10:02:35,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,207 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 10:02:35,207 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 10:02:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,210 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 10:02:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 10:02:35,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:35,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 10:02:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 10:02:35,214 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 23 [2018-11-23 10:02:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:35,214 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 10:02:35,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 10:02:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:02:35,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:35,216 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] [2018-11-23 10:02:35,216 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:35,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash -799813318, now seen corresponding path program 2 times [2018-11-23 10:02:35,217 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:35,218 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:35,239 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:35,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:35,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {902#true} call ULTIMATE.init(); {902#true} is VALID [2018-11-23 10:02:35,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {902#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {902#true} is VALID [2018-11-23 10:02:35,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {902#true} assume true; {902#true} is VALID [2018-11-23 10:02:35,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {902#true} {902#true} #105#return; {902#true} is VALID [2018-11-23 10:02:35,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {902#true} call #t~ret13 := main(); {902#true} is VALID [2018-11-23 10:02:35,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {902#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {902#true} is VALID [2018-11-23 10:02:35,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#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; {902#true} is VALID [2018-11-23 10:02:35,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {902#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {902#true} is VALID [2018-11-23 10:02:35,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#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; {902#true} is VALID [2018-11-23 10:02:35,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {902#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {902#true} is VALID [2018-11-23 10:02:35,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {902#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; {902#true} is VALID [2018-11-23 10:02:35,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {902#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {902#true} is VALID [2018-11-23 10:02:35,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {902#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; {902#true} is VALID [2018-11-23 10:02:35,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {902#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {902#true} is VALID [2018-11-23 10:02:35,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {902#true} assume !~bvslt32(~a~0, 100000bv32); {902#true} is VALID [2018-11-23 10:02:35,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {902#true} havoc ~i~0;~i~0 := 0bv32; {952#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {903#false} is VALID [2018-11-23 10:02:35,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {903#false} ~i~0 := 0bv32; {903#false} is VALID [2018-11-23 10:02:35,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {903#false} assume !~bvslt32(~i~0, 100000bv32); {903#false} is VALID [2018-11-23 10:02:35,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {903#false} ~i~0 := 0bv32; {903#false} is VALID [2018-11-23 10:02:35,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {903#false} assume !~bvslt32(~i~0, 100000bv32); {903#false} is VALID [2018-11-23 10:02:35,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {903#false} ~i~0 := 0bv32; {903#false} is VALID [2018-11-23 10:02:35,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {903#false} assume !~bvslt32(~i~0, 100000bv32); {903#false} is VALID [2018-11-23 10:02:35,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {903#false} havoc ~x~0;~x~0 := 0bv32; {903#false} is VALID [2018-11-23 10:02:35,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {903#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {903#false} is VALID [2018-11-23 10:02:35,356 INFO L256 TraceCheckUtils]: 25: Hoare triple {903#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {903#false} is VALID [2018-11-23 10:02:35,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {903#false} ~cond := #in~cond; {903#false} is VALID [2018-11-23 10:02:35,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {903#false} assume 0bv32 == ~cond; {903#false} is VALID [2018-11-23 10:02:35,357 INFO L273 TraceCheckUtils]: 28: Hoare triple {903#false} assume !false; {903#false} is VALID [2018-11-23 10:02:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 10:02:35,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:35,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:35,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:35,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:02:35,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:35,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:35,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:35,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:35,401 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 3 states. [2018-11-23 10:02:35,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,647 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 10:02:35,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:35,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:02:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-23 10:02:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-23 10:02:35,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2018-11-23 10:02:35,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,851 INFO L225 Difference]: With dead ends: 66 [2018-11-23 10:02:35,852 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 10:02:35,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 10:02:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 10:02:35,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:35,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-23 10:02:35,894 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-23 10:02:35,896 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-23 10:02:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,899 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 10:02:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 10:02:35,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,901 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-23 10:02:35,901 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-23 10:02:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,903 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 10:02:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 10:02:35,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:35,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 10:02:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 10:02:35,908 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2018-11-23 10:02:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:35,908 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 10:02:35,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 10:02:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 10:02:35,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:35,910 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:35,910 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:35,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1433530830, now seen corresponding path program 1 times [2018-11-23 10:02:35,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:35,911 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:35,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:36,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-23 10:02:36,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1237#true} is VALID [2018-11-23 10:02:36,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-23 10:02:36,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #105#return; {1237#true} is VALID [2018-11-23 10:02:36,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret13 := main(); {1237#true} is VALID [2018-11-23 10:02:36,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {1237#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1257#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {1257#(= 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; {1257#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {1257#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1264#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:36,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {1264#(= (_ 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; {1264#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:36,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {1264#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1271#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:36,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {1271#(= (_ 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; {1271#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:36,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {1271#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1278#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:36,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {1278#(= (_ 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; {1278#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:36,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {1278#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1285#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:36,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {1285#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {1238#false} havoc ~i~0;~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1238#false} is VALID [2018-11-23 10:02:36,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {1238#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1238#false} is VALID [2018-11-23 10:02:36,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1238#false} is VALID [2018-11-23 10:02:36,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {1238#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1238#false} is VALID [2018-11-23 10:02:36,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1238#false} is VALID [2018-11-23 10:02:36,215 INFO L273 TraceCheckUtils]: 25: Hoare triple {1238#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1238#false} is VALID [2018-11-23 10:02:36,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,216 INFO L273 TraceCheckUtils]: 27: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1238#false} is VALID [2018-11-23 10:02:36,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {1238#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1238#false} is VALID [2018-11-23 10:02:36,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {1238#false} havoc ~x~0;~x~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {1238#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1238#false} is VALID [2018-11-23 10:02:36,217 INFO L256 TraceCheckUtils]: 33: Hoare triple {1238#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {1238#false} is VALID [2018-11-23 10:02:36,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {1238#false} ~cond := #in~cond; {1238#false} is VALID [2018-11-23 10:02:36,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {1238#false} assume 0bv32 == ~cond; {1238#false} is VALID [2018-11-23 10:02:36,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-23 10:02:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:02:36,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:36,419 INFO L273 TraceCheckUtils]: 36: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-23 10:02:36,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {1238#false} assume 0bv32 == ~cond; {1238#false} is VALID [2018-11-23 10:02:36,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {1238#false} ~cond := #in~cond; {1238#false} is VALID [2018-11-23 10:02:36,420 INFO L256 TraceCheckUtils]: 33: Hoare triple {1238#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {1238#false} is VALID [2018-11-23 10:02:36,420 INFO L273 TraceCheckUtils]: 32: Hoare triple {1238#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1238#false} is VALID [2018-11-23 10:02:36,421 INFO L273 TraceCheckUtils]: 31: Hoare triple {1238#false} havoc ~x~0;~x~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,421 INFO L273 TraceCheckUtils]: 29: Hoare triple {1238#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1238#false} is VALID [2018-11-23 10:02:36,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1238#false} is VALID [2018-11-23 10:02:36,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {1238#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1238#false} is VALID [2018-11-23 10:02:36,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1238#false} is VALID [2018-11-23 10:02:36,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {1238#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1238#false} is VALID [2018-11-23 10:02:36,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1238#false} is VALID [2018-11-23 10:02:36,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {1238#false} ~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {1238#false} assume !~bvslt32(~i~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {1238#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1238#false} is VALID [2018-11-23 10:02:36,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {1238#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1238#false} is VALID [2018-11-23 10:02:36,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {1238#false} havoc ~i~0;~i~0 := 0bv32; {1238#false} is VALID [2018-11-23 10:02:36,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {1421#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1238#false} is VALID [2018-11-23 10:02:36,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {1425#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1421#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:36,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {1425#(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; {1425#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {1432#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1425#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {1432#(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; {1432#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {1439#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1432#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {1439#(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; {1439#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1439#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#(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; {1446#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {1237#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1446#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret13 := main(); {1237#true} is VALID [2018-11-23 10:02:36,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #105#return; {1237#true} is VALID [2018-11-23 10:02:36,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-23 10:02:36,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1237#true} is VALID [2018-11-23 10:02:36,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-23 10:02:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:02:36,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:36,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 10:02:36,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:36,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:36,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:36,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:36,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:36,568 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 12 states. [2018-11-23 10:02:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,545 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2018-11-23 10:02:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:37,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 10:02:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 10:02:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 10:02:37,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2018-11-23 10:02:37,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,737 INFO L225 Difference]: With dead ends: 81 [2018-11-23 10:02:37,738 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:02:37,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:02:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 10:02:37,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:37,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 10:02:37,763 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 10:02:37,764 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 10:02:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,767 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 10:02:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 10:02:37,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,768 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 10:02:37,768 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 10:02:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,774 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 10:02:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 10:02:37,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:37,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 10:02:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-11-23 10:02:37,778 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 37 [2018-11-23 10:02:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:37,779 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-23 10:02:37,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 10:02:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 10:02:37,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:37,780 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:37,780 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:37,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1695718502, now seen corresponding path program 2 times [2018-11-23 10:02:37,781 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:37,781 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:37,802 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:37,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:37,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:38,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {1784#true} call ULTIMATE.init(); {1784#true} is VALID [2018-11-23 10:02:38,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {1784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1784#true} is VALID [2018-11-23 10:02:38,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {1784#true} assume true; {1784#true} is VALID [2018-11-23 10:02:38,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1784#true} {1784#true} #105#return; {1784#true} is VALID [2018-11-23 10:02:38,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {1784#true} call #t~ret13 := main(); {1784#true} is VALID [2018-11-23 10:02:38,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {1784#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1804#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:38,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {1804#(= 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; {1804#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:38,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {1804#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1811#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:38,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {1811#(= (_ 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; {1811#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:38,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {1811#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1818#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:38,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {1818#(= (_ 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; {1818#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:38,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {1818#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1825#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:38,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {1825#(= (_ 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; {1825#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:38,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {1825#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1832#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:38,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {1832#(= (_ 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; {1832#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:38,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {1832#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1839#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:38,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {1839#(= (_ 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; {1839#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:38,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {1839#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1846#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:38,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {1846#(= (_ 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; {1846#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:38,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {1846#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1853#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:38,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {1853#(= (_ 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; {1853#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:38,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {1853#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1860#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:38,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {1860#(= (_ 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; {1860#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:38,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {1860#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1867#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:38,225 INFO L273 TraceCheckUtils]: 24: Hoare triple {1867#(= (_ 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; {1867#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:38,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {1867#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1874#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:38,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {1874#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {1785#false} havoc ~i~0;~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,226 INFO L273 TraceCheckUtils]: 28: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1785#false} is VALID [2018-11-23 10:02:38,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {1785#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1785#false} is VALID [2018-11-23 10:02:38,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1785#false} is VALID [2018-11-23 10:02:38,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {1785#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1785#false} is VALID [2018-11-23 10:02:38,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,228 INFO L273 TraceCheckUtils]: 35: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1785#false} is VALID [2018-11-23 10:02:38,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {1785#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1785#false} is VALID [2018-11-23 10:02:38,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1785#false} is VALID [2018-11-23 10:02:38,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {1785#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1785#false} is VALID [2018-11-23 10:02:38,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {1785#false} havoc ~x~0;~x~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,229 INFO L273 TraceCheckUtils]: 44: Hoare triple {1785#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1785#false} is VALID [2018-11-23 10:02:38,230 INFO L256 TraceCheckUtils]: 45: Hoare triple {1785#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {1785#false} is VALID [2018-11-23 10:02:38,230 INFO L273 TraceCheckUtils]: 46: Hoare triple {1785#false} ~cond := #in~cond; {1785#false} is VALID [2018-11-23 10:02:38,230 INFO L273 TraceCheckUtils]: 47: Hoare triple {1785#false} assume 0bv32 == ~cond; {1785#false} is VALID [2018-11-23 10:02:38,230 INFO L273 TraceCheckUtils]: 48: Hoare triple {1785#false} assume !false; {1785#false} is VALID [2018-11-23 10:02:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:02:38,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:38,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {1785#false} assume !false; {1785#false} is VALID [2018-11-23 10:02:38,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {1785#false} assume 0bv32 == ~cond; {1785#false} is VALID [2018-11-23 10:02:38,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {1785#false} ~cond := #in~cond; {1785#false} is VALID [2018-11-23 10:02:38,983 INFO L256 TraceCheckUtils]: 45: Hoare triple {1785#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {1785#false} is VALID [2018-11-23 10:02:38,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {1785#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1785#false} is VALID [2018-11-23 10:02:38,984 INFO L273 TraceCheckUtils]: 43: Hoare triple {1785#false} havoc ~x~0;~x~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,984 INFO L273 TraceCheckUtils]: 41: Hoare triple {1785#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1785#false} is VALID [2018-11-23 10:02:38,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1785#false} is VALID [2018-11-23 10:02:38,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {1785#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1785#false} is VALID [2018-11-23 10:02:38,986 INFO L273 TraceCheckUtils]: 36: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1785#false} is VALID [2018-11-23 10:02:38,986 INFO L273 TraceCheckUtils]: 35: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {1785#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1785#false} is VALID [2018-11-23 10:02:38,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1785#false} is VALID [2018-11-23 10:02:38,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {1785#false} ~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {1785#false} assume !~bvslt32(~i~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,988 INFO L273 TraceCheckUtils]: 29: Hoare triple {1785#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1785#false} is VALID [2018-11-23 10:02:38,988 INFO L273 TraceCheckUtils]: 28: Hoare triple {1785#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1785#false} is VALID [2018-11-23 10:02:38,988 INFO L273 TraceCheckUtils]: 27: Hoare triple {1785#false} havoc ~i~0;~i~0 := 0bv32; {1785#false} is VALID [2018-11-23 10:02:38,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {2010#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1785#false} is VALID [2018-11-23 10:02:38,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {2014#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2010#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:38,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {2014#(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; {2014#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {2021#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2014#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {2021#(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; {2021#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {2028#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2021#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {2028#(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; {2028#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,003 INFO L273 TraceCheckUtils]: 19: Hoare triple {2035#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2028#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {2035#(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; {2035#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {2042#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2035#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {2042#(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; {2042#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {2049#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2042#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {2049#(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; {2049#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {2056#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2049#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {2056#(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; {2056#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {2063#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2056#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {2063#(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; {2063#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {2070#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2063#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {2070#(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; {2070#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,042 INFO L273 TraceCheckUtils]: 7: Hoare triple {2077#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2070#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {2077#(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; {2077#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {1784#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2077#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:39,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {1784#true} call #t~ret13 := main(); {1784#true} is VALID [2018-11-23 10:02:39,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1784#true} {1784#true} #105#return; {1784#true} is VALID [2018-11-23 10:02:39,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {1784#true} assume true; {1784#true} is VALID [2018-11-23 10:02:39,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {1784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1784#true} is VALID [2018-11-23 10:02:39,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {1784#true} call ULTIMATE.init(); {1784#true} is VALID [2018-11-23 10:02:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:02:39,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:39,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:39,063 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-11-23 10:02:39,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:39,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:39,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:39,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:39,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:39,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:39,265 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 24 states. [2018-11-23 10:02:41,096 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 7 [2018-11-23 10:02:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:42,998 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2018-11-23 10:02:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:42,998 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-11-23 10:02:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2018-11-23 10:02:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2018-11-23 10:02:43,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2018-11-23 10:02:43,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:43,209 INFO L225 Difference]: With dead ends: 105 [2018-11-23 10:02:43,209 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 10:02:43,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 10:02:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 10:02:43,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:43,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-23 10:02:43,250 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 10:02:43,251 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 10:02:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:43,254 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-23 10:02:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-23 10:02:43,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:43,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:43,255 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 10:02:43,256 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 10:02:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:43,259 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-23 10:02:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-23 10:02:43,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:43,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:43,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:43,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 10:02:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-11-23 10:02:43,263 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 49 [2018-11-23 10:02:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:43,263 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-23 10:02:43,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-23 10:02:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 10:02:43,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:43,265 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:43,265 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:43,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1395020082, now seen corresponding path program 3 times [2018-11-23 10:02:43,266 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:43,266 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:43,290 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:43,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:02:43,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:43,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:43,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {2547#true} call ULTIMATE.init(); {2547#true} is VALID [2018-11-23 10:02:43,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {2547#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2547#true} is VALID [2018-11-23 10:02:43,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {2547#true} assume true; {2547#true} is VALID [2018-11-23 10:02:43,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2547#true} {2547#true} #105#return; {2547#true} is VALID [2018-11-23 10:02:43,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {2547#true} call #t~ret13 := main(); {2547#true} is VALID [2018-11-23 10:02:43,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {2547#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2547#true} is VALID [2018-11-23 10:02:43,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,498 INFO L273 TraceCheckUtils]: 26: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,499 INFO L273 TraceCheckUtils]: 29: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,499 INFO L273 TraceCheckUtils]: 33: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,499 INFO L273 TraceCheckUtils]: 34: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,500 INFO L273 TraceCheckUtils]: 36: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,500 INFO L273 TraceCheckUtils]: 37: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,500 INFO L273 TraceCheckUtils]: 38: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,500 INFO L273 TraceCheckUtils]: 39: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,500 INFO L273 TraceCheckUtils]: 40: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,500 INFO L273 TraceCheckUtils]: 41: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,501 INFO L273 TraceCheckUtils]: 42: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,501 INFO L273 TraceCheckUtils]: 43: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,501 INFO L273 TraceCheckUtils]: 45: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,501 INFO L273 TraceCheckUtils]: 46: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,501 INFO L273 TraceCheckUtils]: 47: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,501 INFO L273 TraceCheckUtils]: 48: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,502 INFO L273 TraceCheckUtils]: 49: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,502 INFO L273 TraceCheckUtils]: 50: Hoare triple {2547#true} assume !~bvslt32(~a~0, 100000bv32); {2547#true} is VALID [2018-11-23 10:02:43,502 INFO L273 TraceCheckUtils]: 51: Hoare triple {2547#true} havoc ~i~0;~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 10:02:43,502 INFO L273 TraceCheckUtils]: 52: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2547#true} is VALID [2018-11-23 10:02:43,502 INFO L273 TraceCheckUtils]: 53: Hoare triple {2547#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2547#true} is VALID [2018-11-23 10:02:43,503 INFO L273 TraceCheckUtils]: 54: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 10:02:43,503 INFO L273 TraceCheckUtils]: 55: Hoare triple {2547#true} ~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 10:02:43,503 INFO L273 TraceCheckUtils]: 56: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2547#true} is VALID [2018-11-23 10:02:43,503 INFO L273 TraceCheckUtils]: 57: Hoare triple {2547#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2547#true} is VALID [2018-11-23 10:02:43,503 INFO L273 TraceCheckUtils]: 58: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 10:02:43,504 INFO L273 TraceCheckUtils]: 59: Hoare triple {2547#true} ~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 10:02:43,504 INFO L273 TraceCheckUtils]: 60: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2547#true} is VALID [2018-11-23 10:02:43,504 INFO L273 TraceCheckUtils]: 61: Hoare triple {2547#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2547#true} is VALID [2018-11-23 10:02:43,504 INFO L273 TraceCheckUtils]: 62: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 10:02:43,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {2547#true} ~i~0 := 0bv32; {2741#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:43,516 INFO L273 TraceCheckUtils]: 64: Hoare triple {2741#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2741#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:43,517 INFO L273 TraceCheckUtils]: 65: Hoare triple {2741#(= main_~i~0 (_ bv0 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2748#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,520 INFO L273 TraceCheckUtils]: 66: Hoare triple {2748#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2548#false} is VALID [2018-11-23 10:02:43,520 INFO L273 TraceCheckUtils]: 67: Hoare triple {2548#false} havoc ~x~0;~x~0 := 0bv32; {2548#false} is VALID [2018-11-23 10:02:43,520 INFO L273 TraceCheckUtils]: 68: Hoare triple {2548#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2548#false} is VALID [2018-11-23 10:02:43,520 INFO L256 TraceCheckUtils]: 69: Hoare triple {2548#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {2548#false} is VALID [2018-11-23 10:02:43,520 INFO L273 TraceCheckUtils]: 70: Hoare triple {2548#false} ~cond := #in~cond; {2548#false} is VALID [2018-11-23 10:02:43,521 INFO L273 TraceCheckUtils]: 71: Hoare triple {2548#false} assume 0bv32 == ~cond; {2548#false} is VALID [2018-11-23 10:02:43,521 INFO L273 TraceCheckUtils]: 72: Hoare triple {2548#false} assume !false; {2548#false} is VALID [2018-11-23 10:02:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2018-11-23 10:02:43,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:43,651 INFO L273 TraceCheckUtils]: 72: Hoare triple {2548#false} assume !false; {2548#false} is VALID [2018-11-23 10:02:43,652 INFO L273 TraceCheckUtils]: 71: Hoare triple {2548#false} assume 0bv32 == ~cond; {2548#false} is VALID [2018-11-23 10:02:43,652 INFO L273 TraceCheckUtils]: 70: Hoare triple {2548#false} ~cond := #in~cond; {2548#false} is VALID [2018-11-23 10:02:43,652 INFO L256 TraceCheckUtils]: 69: Hoare triple {2548#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {2548#false} is VALID [2018-11-23 10:02:43,652 INFO L273 TraceCheckUtils]: 68: Hoare triple {2548#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2548#false} is VALID [2018-11-23 10:02:43,652 INFO L273 TraceCheckUtils]: 67: Hoare triple {2548#false} havoc ~x~0;~x~0 := 0bv32; {2548#false} is VALID [2018-11-23 10:02:43,653 INFO L273 TraceCheckUtils]: 66: Hoare triple {2788#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2548#false} is VALID [2018-11-23 10:02:43,653 INFO L273 TraceCheckUtils]: 65: Hoare triple {2792#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2788#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:43,653 INFO L273 TraceCheckUtils]: 64: Hoare triple {2792#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2792#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,654 INFO L273 TraceCheckUtils]: 63: Hoare triple {2547#true} ~i~0 := 0bv32; {2792#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 10:02:43,654 INFO L273 TraceCheckUtils]: 61: Hoare triple {2547#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2547#true} is VALID [2018-11-23 10:02:43,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2547#true} is VALID [2018-11-23 10:02:43,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {2547#true} ~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 10:02:43,655 INFO L273 TraceCheckUtils]: 58: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 10:02:43,655 INFO L273 TraceCheckUtils]: 57: Hoare triple {2547#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2547#true} is VALID [2018-11-23 10:02:43,656 INFO L273 TraceCheckUtils]: 56: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2547#true} is VALID [2018-11-23 10:02:43,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {2547#true} ~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 10:02:43,656 INFO L273 TraceCheckUtils]: 54: Hoare triple {2547#true} assume !~bvslt32(~i~0, 100000bv32); {2547#true} is VALID [2018-11-23 10:02:43,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {2547#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2547#true} is VALID [2018-11-23 10:02:43,657 INFO L273 TraceCheckUtils]: 52: Hoare triple {2547#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2547#true} is VALID [2018-11-23 10:02:43,657 INFO L273 TraceCheckUtils]: 51: Hoare triple {2547#true} havoc ~i~0;~i~0 := 0bv32; {2547#true} is VALID [2018-11-23 10:02:43,657 INFO L273 TraceCheckUtils]: 50: Hoare triple {2547#true} assume !~bvslt32(~a~0, 100000bv32); {2547#true} is VALID [2018-11-23 10:02:43,658 INFO L273 TraceCheckUtils]: 49: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,659 INFO L273 TraceCheckUtils]: 46: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,659 INFO L273 TraceCheckUtils]: 43: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,659 INFO L273 TraceCheckUtils]: 42: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,660 INFO L273 TraceCheckUtils]: 40: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,660 INFO L273 TraceCheckUtils]: 39: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,661 INFO L273 TraceCheckUtils]: 37: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,661 INFO L273 TraceCheckUtils]: 36: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,661 INFO L273 TraceCheckUtils]: 35: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,662 INFO L273 TraceCheckUtils]: 33: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,662 INFO L273 TraceCheckUtils]: 32: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,662 INFO L273 TraceCheckUtils]: 31: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,662 INFO L273 TraceCheckUtils]: 30: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,663 INFO L273 TraceCheckUtils]: 27: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {2547#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#true} is VALID [2018-11-23 10:02:43,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {2547#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; {2547#true} is VALID [2018-11-23 10:02:43,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {2547#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2547#true} is VALID [2018-11-23 10:02:43,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {2547#true} call #t~ret13 := main(); {2547#true} is VALID [2018-11-23 10:02:43,669 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2547#true} {2547#true} #105#return; {2547#true} is VALID [2018-11-23 10:02:43,669 INFO L273 TraceCheckUtils]: 2: Hoare triple {2547#true} assume true; {2547#true} is VALID [2018-11-23 10:02:43,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {2547#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2547#true} is VALID [2018-11-23 10:02:43,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {2547#true} call ULTIMATE.init(); {2547#true} is VALID [2018-11-23 10:02:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2018-11-23 10:02:43,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:43,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:43,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-23 10:02:43,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:43,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:43,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:43,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:43,740 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2018-11-23 10:02:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,436 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 10:02:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:44,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-23 10:02:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 10:02:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 10:02:44,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-23 10:02:44,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:44,625 INFO L225 Difference]: With dead ends: 125 [2018-11-23 10:02:44,626 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 10:02:44,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 10:02:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-23 10:02:44,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:44,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 102 states. [2018-11-23 10:02:44,663 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 102 states. [2018-11-23 10:02:44,663 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 102 states. [2018-11-23 10:02:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,667 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-23 10:02:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-23 10:02:44,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:44,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:44,667 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 102 states. [2018-11-23 10:02:44,668 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 102 states. [2018-11-23 10:02:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,671 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-23 10:02:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-23 10:02:44,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:44,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:44,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:44,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 10:02:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-11-23 10:02:44,675 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 73 [2018-11-23 10:02:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:44,676 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-11-23 10:02:44,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-23 10:02:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 10:02:44,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:44,677 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:44,677 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:44,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1417462198, now seen corresponding path program 4 times [2018-11-23 10:02:44,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:44,678 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:44,695 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:44,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:44,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:44,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:45,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {3533#true} call ULTIMATE.init(); {3533#true} is VALID [2018-11-23 10:02:45,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {3533#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3533#true} is VALID [2018-11-23 10:02:45,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {3533#true} assume true; {3533#true} is VALID [2018-11-23 10:02:45,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3533#true} {3533#true} #105#return; {3533#true} is VALID [2018-11-23 10:02:45,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {3533#true} call #t~ret13 := main(); {3533#true} is VALID [2018-11-23 10:02:45,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {3533#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3553#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:45,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {3553#(= 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; {3553#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:45,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {3553#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3560#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:45,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {3560#(= (_ 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; {3560#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:45,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {3560#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3567#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:45,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {3567#(= (_ 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; {3567#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:45,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {3567#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3574#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:45,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {3574#(= (_ 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; {3574#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:45,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {3574#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3581#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:45,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {3581#(= (_ 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; {3581#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:45,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {3581#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3588#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:45,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {3588#(= (_ 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; {3588#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:45,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {3588#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3595#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:45,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {3595#(= (_ 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; {3595#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:45,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {3595#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3602#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:45,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {3602#(= (_ 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; {3602#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:45,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {3602#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3609#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:45,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {3609#(= (_ 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; {3609#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:45,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {3609#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3616#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:45,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {3616#(= (_ 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; {3616#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:45,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {3616#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3623#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:45,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {3623#(= (_ 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; {3623#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:45,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {3623#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3630#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:45,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {3630#(= (_ 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; {3630#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:45,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {3630#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3637#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:45,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {3637#(= (_ 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; {3637#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:45,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {3637#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3644#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:45,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {3644#(= (_ 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; {3644#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:45,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {3644#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3651#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:45,452 INFO L273 TraceCheckUtils]: 34: Hoare triple {3651#(= (_ 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; {3651#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:45,453 INFO L273 TraceCheckUtils]: 35: Hoare triple {3651#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3658#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:45,453 INFO L273 TraceCheckUtils]: 36: Hoare triple {3658#(= (_ 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; {3658#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:45,454 INFO L273 TraceCheckUtils]: 37: Hoare triple {3658#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3665#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:45,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {3665#(= (_ 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; {3665#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:45,455 INFO L273 TraceCheckUtils]: 39: Hoare triple {3665#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3672#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:45,456 INFO L273 TraceCheckUtils]: 40: Hoare triple {3672#(= (_ 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; {3672#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:45,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {3672#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3679#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:45,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {3679#(= (_ 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; {3679#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:45,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {3679#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3686#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:45,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {3686#(= (_ 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; {3686#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:45,459 INFO L273 TraceCheckUtils]: 45: Hoare triple {3686#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3693#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:45,459 INFO L273 TraceCheckUtils]: 46: Hoare triple {3693#(= (_ 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; {3693#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:45,460 INFO L273 TraceCheckUtils]: 47: Hoare triple {3693#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3700#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:45,461 INFO L273 TraceCheckUtils]: 48: Hoare triple {3700#(= (_ 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; {3700#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:45,461 INFO L273 TraceCheckUtils]: 49: Hoare triple {3700#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3707#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 10:02:45,462 INFO L273 TraceCheckUtils]: 50: Hoare triple {3707#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:45,462 INFO L273 TraceCheckUtils]: 51: Hoare triple {3534#false} havoc ~i~0;~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:45,462 INFO L273 TraceCheckUtils]: 52: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3534#false} is VALID [2018-11-23 10:02:45,463 INFO L273 TraceCheckUtils]: 53: Hoare triple {3534#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3534#false} is VALID [2018-11-23 10:02:45,463 INFO L273 TraceCheckUtils]: 54: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3534#false} is VALID [2018-11-23 10:02:45,463 INFO L273 TraceCheckUtils]: 55: Hoare triple {3534#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3534#false} is VALID [2018-11-23 10:02:45,464 INFO L273 TraceCheckUtils]: 56: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3534#false} is VALID [2018-11-23 10:02:45,464 INFO L273 TraceCheckUtils]: 57: Hoare triple {3534#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3534#false} is VALID [2018-11-23 10:02:45,464 INFO L273 TraceCheckUtils]: 58: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3534#false} is VALID [2018-11-23 10:02:45,465 INFO L273 TraceCheckUtils]: 59: Hoare triple {3534#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3534#false} is VALID [2018-11-23 10:02:45,465 INFO L273 TraceCheckUtils]: 60: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:45,465 INFO L273 TraceCheckUtils]: 61: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:45,466 INFO L273 TraceCheckUtils]: 62: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3534#false} is VALID [2018-11-23 10:02:45,466 INFO L273 TraceCheckUtils]: 63: Hoare triple {3534#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3534#false} is VALID [2018-11-23 10:02:45,466 INFO L273 TraceCheckUtils]: 64: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3534#false} is VALID [2018-11-23 10:02:45,467 INFO L273 TraceCheckUtils]: 65: Hoare triple {3534#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3534#false} is VALID [2018-11-23 10:02:45,467 INFO L273 TraceCheckUtils]: 66: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3534#false} is VALID [2018-11-23 10:02:45,467 INFO L273 TraceCheckUtils]: 67: Hoare triple {3534#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3534#false} is VALID [2018-11-23 10:02:45,467 INFO L273 TraceCheckUtils]: 68: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3534#false} is VALID [2018-11-23 10:02:45,468 INFO L273 TraceCheckUtils]: 69: Hoare triple {3534#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3534#false} is VALID [2018-11-23 10:02:45,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:45,468 INFO L273 TraceCheckUtils]: 71: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:45,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3534#false} is VALID [2018-11-23 10:02:45,468 INFO L273 TraceCheckUtils]: 73: Hoare triple {3534#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3534#false} is VALID [2018-11-23 10:02:45,469 INFO L273 TraceCheckUtils]: 74: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3534#false} is VALID [2018-11-23 10:02:45,469 INFO L273 TraceCheckUtils]: 75: Hoare triple {3534#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3534#false} is VALID [2018-11-23 10:02:45,469 INFO L273 TraceCheckUtils]: 76: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3534#false} is VALID [2018-11-23 10:02:45,469 INFO L273 TraceCheckUtils]: 77: Hoare triple {3534#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3534#false} is VALID [2018-11-23 10:02:45,469 INFO L273 TraceCheckUtils]: 78: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3534#false} is VALID [2018-11-23 10:02:45,470 INFO L273 TraceCheckUtils]: 79: Hoare triple {3534#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3534#false} is VALID [2018-11-23 10:02:45,470 INFO L273 TraceCheckUtils]: 80: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:45,470 INFO L273 TraceCheckUtils]: 81: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:45,470 INFO L273 TraceCheckUtils]: 82: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3534#false} is VALID [2018-11-23 10:02:45,470 INFO L273 TraceCheckUtils]: 83: Hoare triple {3534#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3534#false} is VALID [2018-11-23 10:02:45,471 INFO L273 TraceCheckUtils]: 84: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3534#false} is VALID [2018-11-23 10:02:45,471 INFO L273 TraceCheckUtils]: 85: Hoare triple {3534#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3534#false} is VALID [2018-11-23 10:02:45,471 INFO L273 TraceCheckUtils]: 86: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3534#false} is VALID [2018-11-23 10:02:45,471 INFO L273 TraceCheckUtils]: 87: Hoare triple {3534#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3534#false} is VALID [2018-11-23 10:02:45,471 INFO L273 TraceCheckUtils]: 88: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3534#false} is VALID [2018-11-23 10:02:45,472 INFO L273 TraceCheckUtils]: 89: Hoare triple {3534#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3534#false} is VALID [2018-11-23 10:02:45,472 INFO L273 TraceCheckUtils]: 90: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:45,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {3534#false} havoc ~x~0;~x~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:45,472 INFO L273 TraceCheckUtils]: 92: Hoare triple {3534#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3534#false} is VALID [2018-11-23 10:02:45,472 INFO L256 TraceCheckUtils]: 93: Hoare triple {3534#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {3534#false} is VALID [2018-11-23 10:02:45,472 INFO L273 TraceCheckUtils]: 94: Hoare triple {3534#false} ~cond := #in~cond; {3534#false} is VALID [2018-11-23 10:02:45,473 INFO L273 TraceCheckUtils]: 95: Hoare triple {3534#false} assume 0bv32 == ~cond; {3534#false} is VALID [2018-11-23 10:02:45,473 INFO L273 TraceCheckUtils]: 96: Hoare triple {3534#false} assume !false; {3534#false} is VALID [2018-11-23 10:02:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 10:02:45,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:47,536 INFO L273 TraceCheckUtils]: 96: Hoare triple {3534#false} assume !false; {3534#false} is VALID [2018-11-23 10:02:47,537 INFO L273 TraceCheckUtils]: 95: Hoare triple {3534#false} assume 0bv32 == ~cond; {3534#false} is VALID [2018-11-23 10:02:47,537 INFO L273 TraceCheckUtils]: 94: Hoare triple {3534#false} ~cond := #in~cond; {3534#false} is VALID [2018-11-23 10:02:47,537 INFO L256 TraceCheckUtils]: 93: Hoare triple {3534#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {3534#false} is VALID [2018-11-23 10:02:47,538 INFO L273 TraceCheckUtils]: 92: Hoare triple {3534#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3534#false} is VALID [2018-11-23 10:02:47,538 INFO L273 TraceCheckUtils]: 91: Hoare triple {3534#false} havoc ~x~0;~x~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:47,538 INFO L273 TraceCheckUtils]: 90: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:47,538 INFO L273 TraceCheckUtils]: 89: Hoare triple {3534#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3534#false} is VALID [2018-11-23 10:02:47,538 INFO L273 TraceCheckUtils]: 88: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3534#false} is VALID [2018-11-23 10:02:47,539 INFO L273 TraceCheckUtils]: 87: Hoare triple {3534#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3534#false} is VALID [2018-11-23 10:02:47,539 INFO L273 TraceCheckUtils]: 86: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3534#false} is VALID [2018-11-23 10:02:47,539 INFO L273 TraceCheckUtils]: 85: Hoare triple {3534#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3534#false} is VALID [2018-11-23 10:02:47,539 INFO L273 TraceCheckUtils]: 84: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3534#false} is VALID [2018-11-23 10:02:47,539 INFO L273 TraceCheckUtils]: 83: Hoare triple {3534#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3534#false} is VALID [2018-11-23 10:02:47,539 INFO L273 TraceCheckUtils]: 82: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3534#false} is VALID [2018-11-23 10:02:47,540 INFO L273 TraceCheckUtils]: 81: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:47,540 INFO L273 TraceCheckUtils]: 80: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:47,540 INFO L273 TraceCheckUtils]: 79: Hoare triple {3534#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3534#false} is VALID [2018-11-23 10:02:47,540 INFO L273 TraceCheckUtils]: 78: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3534#false} is VALID [2018-11-23 10:02:47,540 INFO L273 TraceCheckUtils]: 77: Hoare triple {3534#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3534#false} is VALID [2018-11-23 10:02:47,540 INFO L273 TraceCheckUtils]: 76: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3534#false} is VALID [2018-11-23 10:02:47,541 INFO L273 TraceCheckUtils]: 75: Hoare triple {3534#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3534#false} is VALID [2018-11-23 10:02:47,541 INFO L273 TraceCheckUtils]: 74: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3534#false} is VALID [2018-11-23 10:02:47,541 INFO L273 TraceCheckUtils]: 73: Hoare triple {3534#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3534#false} is VALID [2018-11-23 10:02:47,541 INFO L273 TraceCheckUtils]: 72: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3534#false} is VALID [2018-11-23 10:02:47,541 INFO L273 TraceCheckUtils]: 71: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:47,541 INFO L273 TraceCheckUtils]: 70: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:47,542 INFO L273 TraceCheckUtils]: 69: Hoare triple {3534#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3534#false} is VALID [2018-11-23 10:02:47,542 INFO L273 TraceCheckUtils]: 68: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3534#false} is VALID [2018-11-23 10:02:47,542 INFO L273 TraceCheckUtils]: 67: Hoare triple {3534#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3534#false} is VALID [2018-11-23 10:02:47,542 INFO L273 TraceCheckUtils]: 66: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3534#false} is VALID [2018-11-23 10:02:47,542 INFO L273 TraceCheckUtils]: 65: Hoare triple {3534#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3534#false} is VALID [2018-11-23 10:02:47,542 INFO L273 TraceCheckUtils]: 64: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3534#false} is VALID [2018-11-23 10:02:47,543 INFO L273 TraceCheckUtils]: 63: Hoare triple {3534#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3534#false} is VALID [2018-11-23 10:02:47,543 INFO L273 TraceCheckUtils]: 62: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3534#false} is VALID [2018-11-23 10:02:47,543 INFO L273 TraceCheckUtils]: 61: Hoare triple {3534#false} ~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:47,543 INFO L273 TraceCheckUtils]: 60: Hoare triple {3534#false} assume !~bvslt32(~i~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:47,544 INFO L273 TraceCheckUtils]: 59: Hoare triple {3534#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3534#false} is VALID [2018-11-23 10:02:47,544 INFO L273 TraceCheckUtils]: 58: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3534#false} is VALID [2018-11-23 10:02:47,544 INFO L273 TraceCheckUtils]: 57: Hoare triple {3534#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3534#false} is VALID [2018-11-23 10:02:47,544 INFO L273 TraceCheckUtils]: 56: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3534#false} is VALID [2018-11-23 10:02:47,544 INFO L273 TraceCheckUtils]: 55: Hoare triple {3534#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3534#false} is VALID [2018-11-23 10:02:47,544 INFO L273 TraceCheckUtils]: 54: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3534#false} is VALID [2018-11-23 10:02:47,545 INFO L273 TraceCheckUtils]: 53: Hoare triple {3534#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3534#false} is VALID [2018-11-23 10:02:47,545 INFO L273 TraceCheckUtils]: 52: Hoare triple {3534#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3534#false} is VALID [2018-11-23 10:02:47,545 INFO L273 TraceCheckUtils]: 51: Hoare triple {3534#false} havoc ~i~0;~i~0 := 0bv32; {3534#false} is VALID [2018-11-23 10:02:47,545 INFO L273 TraceCheckUtils]: 50: Hoare triple {3987#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {3534#false} is VALID [2018-11-23 10:02:47,547 INFO L273 TraceCheckUtils]: 49: Hoare triple {3991#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3987#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:47,547 INFO L273 TraceCheckUtils]: 48: Hoare triple {3991#(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; {3991#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {3998#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3991#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {3998#(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; {3998#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,557 INFO L273 TraceCheckUtils]: 45: Hoare triple {4005#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3998#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,558 INFO L273 TraceCheckUtils]: 44: Hoare triple {4005#(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; {4005#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,562 INFO L273 TraceCheckUtils]: 43: Hoare triple {4012#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4005#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,563 INFO L273 TraceCheckUtils]: 42: Hoare triple {4012#(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; {4012#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,570 INFO L273 TraceCheckUtils]: 41: Hoare triple {4019#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4012#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,571 INFO L273 TraceCheckUtils]: 40: Hoare triple {4019#(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; {4019#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,577 INFO L273 TraceCheckUtils]: 39: Hoare triple {4026#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4019#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {4026#(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; {4026#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,584 INFO L273 TraceCheckUtils]: 37: Hoare triple {4033#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4026#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {4033#(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; {4033#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,589 INFO L273 TraceCheckUtils]: 35: Hoare triple {4040#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4033#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {4040#(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; {4040#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,594 INFO L273 TraceCheckUtils]: 33: Hoare triple {4047#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4040#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {4047#(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; {4047#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {4054#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4047#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,601 INFO L273 TraceCheckUtils]: 30: Hoare triple {4054#(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; {4054#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {4061#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4054#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {4061#(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; {4061#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {4068#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4061#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {4068#(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; {4068#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {4075#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4068#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {4075#(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; {4075#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {4082#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4075#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {4082#(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; {4082#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {4089#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4082#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {4089#(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; {4089#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,636 INFO L273 TraceCheckUtils]: 19: Hoare triple {4096#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4089#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {4096#(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; {4096#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {4103#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4096#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {4103#(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; {4103#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {4110#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4103#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {4110#(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; {4110#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {4117#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4110#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {4117#(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; {4117#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {4124#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4117#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#(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; {4124#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {4131#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4124#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {4131#(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; {4131#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {4138#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4131#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {4138#(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; {4138#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {3533#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4138#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {3533#true} call #t~ret13 := main(); {3533#true} is VALID [2018-11-23 10:02:47,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3533#true} {3533#true} #105#return; {3533#true} is VALID [2018-11-23 10:02:47,675 INFO L273 TraceCheckUtils]: 2: Hoare triple {3533#true} assume true; {3533#true} is VALID [2018-11-23 10:02:47,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {3533#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3533#true} is VALID [2018-11-23 10:02:47,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {3533#true} call ULTIMATE.init(); {3533#true} is VALID [2018-11-23 10:02:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 10:02:47,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:47,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:47,693 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 97 [2018-11-23 10:02:47,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:47,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:48,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:48,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:48,067 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 48 states. [2018-11-23 10:02:52,754 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:02:53,238 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:02:53,731 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:02:54,259 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:02:54,829 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:02:55,394 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:03:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:03,821 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2018-11-23 10:03:03,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:03:03,821 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 97 [2018-11-23 10:03:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:03:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 178 transitions. [2018-11-23 10:03:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 178 transitions. [2018-11-23 10:03:03,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 178 transitions. [2018-11-23 10:03:04,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:04,214 INFO L225 Difference]: With dead ends: 201 [2018-11-23 10:03:04,215 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 10:03:04,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:03:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 10:03:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-23 10:03:04,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:03:04,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 150 states. [2018-11-23 10:03:04,440 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 150 states. [2018-11-23 10:03:04,440 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 150 states. [2018-11-23 10:03:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:04,445 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-23 10:03:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-23 10:03:04,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:04,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:04,446 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 150 states. [2018-11-23 10:03:04,446 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 150 states. [2018-11-23 10:03:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:04,450 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-23 10:03:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-23 10:03:04,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:04,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:04,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:03:04,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:03:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 10:03:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2018-11-23 10:03:04,456 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 97 [2018-11-23 10:03:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:03:04,457 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2018-11-23 10:03:04,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:03:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-23 10:03:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 10:03:04,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:03:04,459 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:03:04,459 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:03:04,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:03:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1524190854, now seen corresponding path program 5 times [2018-11-23 10:03:04,460 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:03:04,460 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:03:04,488 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1