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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init3_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 15:54:41,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 15:54:41,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 15:54:41,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 15:54:41,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 15:54:41,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 15:54:41,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 15:54:41,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 15:54:41,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 15:54:41,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 15:54:41,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 15:54:41,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 15:54:41,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 15:54:41,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 15:54:41,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 15:54:41,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 15:54:41,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 15:54:41,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 15:54:41,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 15:54:41,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 15:54:41,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 15:54:41,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 15:54:41,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 15:54:41,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 15:54:41,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 15:54:41,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 15:54:41,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 15:54:41,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 15:54:41,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 15:54:41,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 15:54:41,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 15:54:41,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 15:54:41,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 15:54:41,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 15:54:41,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 15:54:41,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 15:54:41,660 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-14 15:54:41,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 15:54:41,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 15:54:41,689 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 15:54:41,690 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 15:54:41,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 15:54:41,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 15:54:41,692 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 15:54:41,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 15:54:41,693 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 15:54:41,693 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 15:54:41,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 15:54:41,693 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 15:54:41,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 15:54:41,694 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 15:54:41,694 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 15:54:41,694 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 15:54:41,694 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 15:54:41,694 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 15:54:41,694 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 15:54:41,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 15:54:41,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 15:54:41,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 15:54:41,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 15:54:41,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 15:54:41,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 15:54:41,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 15:54:41,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 15:54:41,698 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 15:54:41,698 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 15:54:41,698 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 15:54:41,698 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 15:54:41,699 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 15:54:41,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 15:54:41,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 15:54:41,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 15:54:41,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 15:54:41,769 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 15:54:41,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init3_true-unreach-call_ground.i [2018-11-14 15:54:41,834 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3445b03d4/dd460fb96b3d4d129d7b80375885cdc6/FLAGe9c504715 [2018-11-14 15:54:42,326 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 15:54:42,326 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init3_true-unreach-call_ground.i [2018-11-14 15:54:42,334 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3445b03d4/dd460fb96b3d4d129d7b80375885cdc6/FLAGe9c504715 [2018-11-14 15:54:42,354 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3445b03d4/dd460fb96b3d4d129d7b80375885cdc6 [2018-11-14 15:54:42,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 15:54:42,366 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 15:54:42,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 15:54:42,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 15:54:42,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 15:54:42,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534a04b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42, skipping insertion in model container [2018-11-14 15:54:42,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 15:54:42,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 15:54:42,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:54:42,665 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 15:54:42,697 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:54:42,731 INFO L195 MainTranslator]: Completed translation [2018-11-14 15:54:42,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42 WrapperNode [2018-11-14 15:54:42,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 15:54:42,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 15:54:42,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 15:54:42,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 15:54:42,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (1/1) ... [2018-11-14 15:54:42,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 15:54:42,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 15:54:42,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 15:54:42,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 15:54:42,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (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-14 15:54:42,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 15:54:42,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 15:54:42,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 15:54:42,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 15:54:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 15:54:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 15:54:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 15:54:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 15:54:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 15:54:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 15:54:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 15:54:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 15:54:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 15:54:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 15:54:43,547 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 15:54:43,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:54:43 BoogieIcfgContainer [2018-11-14 15:54:43,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 15:54:43,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 15:54:43,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 15:54:43,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 15:54:43,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:54:42" (1/3) ... [2018-11-14 15:54:43,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfeebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:54:43, skipping insertion in model container [2018-11-14 15:54:43,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:54:42" (2/3) ... [2018-11-14 15:54:43,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfeebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:54:43, skipping insertion in model container [2018-11-14 15:54:43,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:54:43" (3/3) ... [2018-11-14 15:54:43,557 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init3_true-unreach-call_ground.i [2018-11-14 15:54:43,568 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 15:54:43,576 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 15:54:43,594 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 15:54:43,626 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 15:54:43,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 15:54:43,627 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 15:54:43,627 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 15:54:43,628 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 15:54:43,628 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 15:54:43,628 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 15:54:43,628 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 15:54:43,629 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 15:54:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-14 15:54:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 15:54:43,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:54:43,655 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:54:43,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:54:43,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:54:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash 546316117, now seen corresponding path program 1 times [2018-11-14 15:54:43,670 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:54:43,671 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-14 15:54:43,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:54:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:54:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:54:43,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:54:43,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-14 15:54:43,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {34#true} is VALID [2018-11-14 15:54:43,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 15:54:43,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #78#return; {34#true} is VALID [2018-11-14 15:54:43,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret2 := main(); {34#true} is VALID [2018-11-14 15:54:43,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {34#true} is VALID [2018-11-14 15:54:43,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-14 15:54:43,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#false} ~i~0 := 0bv32; {35#false} is VALID [2018-11-14 15:54:43,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-14 15:54:43,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} ~i~0 := 0bv32; {35#false} is VALID [2018-11-14 15:54:43,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-14 15:54:43,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} havoc ~x~0;~x~0 := 0bv32; {35#false} is VALID [2018-11-14 15:54:43,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-14 15:54:43,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {35#false} is VALID [2018-11-14 15:54:43,916 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {35#false} is VALID [2018-11-14 15:54:43,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-14 15:54:43,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume ~cond == 0bv32; {35#false} is VALID [2018-11-14 15:54:43,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-14 15:54:43,920 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-14 15:54:43,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:54:43,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:54:43,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 15:54:43,934 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 15:54:43,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:54:43,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 15:54:44,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:54:44,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 15:54:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 15:54:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 15:54:44,171 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-14 15:54:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:44,359 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-14 15:54:44,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 15:54:44,359 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 15:54:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:54:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:54:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-14 15:54:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:54:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-14 15:54:44,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 69 transitions. [2018-11-14 15:54:44,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:54:44,714 INFO L225 Difference]: With dead ends: 54 [2018-11-14 15:54:44,715 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 15:54:44,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-14 15:54:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 15:54:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 15:54:44,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:54:44,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 15:54:44,768 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 15:54:44,768 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 15:54:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:44,773 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 15:54:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 15:54:44,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:54:44,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:54:44,774 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 15:54:44,774 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 15:54:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:44,779 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 15:54:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 15:54:44,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:54:44,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:54:44,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:54:44,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:54:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 15:54:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-14 15:54:44,785 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2018-11-14 15:54:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:54:44,786 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-14 15:54:44,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 15:54:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 15:54:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 15:54:44,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:54:44,787 INFO L375 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-14 15:54:44,788 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:54:44,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:54:44,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1482380482, now seen corresponding path program 1 times [2018-11-14 15:54:44,789 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:54:44,789 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-14 15:54:44,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:54:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:54:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:54:44,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:54:44,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2018-11-14 15:54:44,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {246#true} is VALID [2018-11-14 15:54:44,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2018-11-14 15:54:44,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #78#return; {246#true} is VALID [2018-11-14 15:54:44,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret2 := main(); {246#true} is VALID [2018-11-14 15:54:44,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {246#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {266#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:54:44,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {266#(= main_~i~0 (_ bv0 32))} assume true; {266#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:54:44,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {266#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {247#false} is VALID [2018-11-14 15:54:44,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {247#false} ~i~0 := 0bv32; {247#false} is VALID [2018-11-14 15:54:44,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {247#false} assume true; {247#false} is VALID [2018-11-14 15:54:44,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {247#false} assume !~bvslt32(~i~0, 100000bv32); {247#false} is VALID [2018-11-14 15:54:44,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {247#false} ~i~0 := 0bv32; {247#false} is VALID [2018-11-14 15:54:44,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {247#false} assume true; {247#false} is VALID [2018-11-14 15:54:44,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {247#false} assume !~bvslt32(~i~0, 100000bv32); {247#false} is VALID [2018-11-14 15:54:44,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {247#false} havoc ~x~0;~x~0 := 0bv32; {247#false} is VALID [2018-11-14 15:54:44,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {247#false} assume true; {247#false} is VALID [2018-11-14 15:54:44,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {247#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {247#false} is VALID [2018-11-14 15:54:44,974 INFO L256 TraceCheckUtils]: 17: Hoare triple {247#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {247#false} is VALID [2018-11-14 15:54:44,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {247#false} ~cond := #in~cond; {247#false} is VALID [2018-11-14 15:54:44,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {247#false} assume ~cond == 0bv32; {247#false} is VALID [2018-11-14 15:54:44,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {247#false} assume !false; {247#false} is VALID [2018-11-14 15:54:44,977 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-14 15:54:44,978 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:54:44,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:54:44,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:54:44,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 15:54:44,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:54:44,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:54:45,098 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-14 15:54:45,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:54:45,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:54:45,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:54:45,099 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-14 15:54:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:45,532 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-14 15:54:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:54:45,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 15:54:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:54:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:54:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 15:54:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:54:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 15:54:45,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-14 15:54:45,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:54:45,678 INFO L225 Difference]: With dead ends: 50 [2018-11-14 15:54:45,678 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 15:54:45,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-14 15:54:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 15:54:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 15:54:45,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:54:45,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 15:54:45,698 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 15:54:45,699 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 15:54:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:45,702 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 15:54:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 15:54:45,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:54:45,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:54:45,703 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 15:54:45,704 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 15:54:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:45,707 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 15:54:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 15:54:45,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:54:45,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:54:45,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:54:45,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:54:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 15:54:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-14 15:54:45,711 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 21 [2018-11-14 15:54:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:54:45,712 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-14 15:54:45,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:54:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 15:54:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 15:54:45,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:54:45,713 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:54:45,713 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:54:45,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:54:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash -920677416, now seen corresponding path program 1 times [2018-11-14 15:54:45,715 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:54:45,715 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-14 15:54:45,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:54:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:54:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:54:45,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:54:45,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {488#true} is VALID [2018-11-14 15:54:45,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {488#true} is VALID [2018-11-14 15:54:45,908 INFO L273 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2018-11-14 15:54:45,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #78#return; {488#true} is VALID [2018-11-14 15:54:45,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret2 := main(); {488#true} is VALID [2018-11-14 15:54:45,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {488#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {508#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:54:45,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {508#(= main_~i~0 (_ bv0 32))} assume true; {508#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:54:45,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {508#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {515#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:45,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {515#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {515#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:45,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {515#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {489#false} is VALID [2018-11-14 15:54:45,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {489#false} ~i~0 := 0bv32; {489#false} is VALID [2018-11-14 15:54:45,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:45,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {489#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {489#false} is VALID [2018-11-14 15:54:45,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:45,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {489#false} assume !~bvslt32(~i~0, 100000bv32); {489#false} is VALID [2018-11-14 15:54:45,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {489#false} ~i~0 := 0bv32; {489#false} is VALID [2018-11-14 15:54:45,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:45,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {489#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {489#false} is VALID [2018-11-14 15:54:45,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:45,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {489#false} assume !~bvslt32(~i~0, 100000bv32); {489#false} is VALID [2018-11-14 15:54:45,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {489#false} havoc ~x~0;~x~0 := 0bv32; {489#false} is VALID [2018-11-14 15:54:45,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:45,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {489#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {489#false} is VALID [2018-11-14 15:54:45,932 INFO L256 TraceCheckUtils]: 23: Hoare triple {489#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {489#false} is VALID [2018-11-14 15:54:45,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {489#false} ~cond := #in~cond; {489#false} is VALID [2018-11-14 15:54:45,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {489#false} assume ~cond == 0bv32; {489#false} is VALID [2018-11-14 15:54:45,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {489#false} assume !false; {489#false} is VALID [2018-11-14 15:54:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 15:54:45,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:54:46,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {489#false} assume !false; {489#false} is VALID [2018-11-14 15:54:46,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {489#false} assume ~cond == 0bv32; {489#false} is VALID [2018-11-14 15:54:46,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {489#false} ~cond := #in~cond; {489#false} is VALID [2018-11-14 15:54:46,089 INFO L256 TraceCheckUtils]: 23: Hoare triple {489#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {489#false} is VALID [2018-11-14 15:54:46,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {489#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {489#false} is VALID [2018-11-14 15:54:46,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:46,090 INFO L273 TraceCheckUtils]: 20: Hoare triple {489#false} havoc ~x~0;~x~0 := 0bv32; {489#false} is VALID [2018-11-14 15:54:46,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {489#false} assume !~bvslt32(~i~0, 100000bv32); {489#false} is VALID [2018-11-14 15:54:46,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:46,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {489#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {489#false} is VALID [2018-11-14 15:54:46,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:46,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {489#false} ~i~0 := 0bv32; {489#false} is VALID [2018-11-14 15:54:46,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {489#false} assume !~bvslt32(~i~0, 100000bv32); {489#false} is VALID [2018-11-14 15:54:46,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:46,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {489#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {489#false} is VALID [2018-11-14 15:54:46,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {489#false} assume true; {489#false} is VALID [2018-11-14 15:54:46,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {489#false} ~i~0 := 0bv32; {489#false} is VALID [2018-11-14 15:54:46,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {624#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {489#false} is VALID [2018-11-14 15:54:46,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {624#(bvslt main_~i~0 (_ bv100000 32))} assume true; {624#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:54:46,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {631#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {624#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:54:46,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {631#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {631#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:46,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {488#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {631#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:46,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret2 := main(); {488#true} is VALID [2018-11-14 15:54:46,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #78#return; {488#true} is VALID [2018-11-14 15:54:46,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2018-11-14 15:54:46,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {488#true} is VALID [2018-11-14 15:54:46,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {488#true} is VALID [2018-11-14 15:54:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 15:54:46,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:54:46,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 15:54:46,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-14 15:54:46,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:54:46,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 15:54:46,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:54:46,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 15:54:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 15:54:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 15:54:46,186 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 6 states. [2018-11-14 15:54:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:46,782 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2018-11-14 15:54:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 15:54:46,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-14 15:54:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:54:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:54:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-14 15:54:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:54:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-14 15:54:46,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2018-11-14 15:54:46,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:54:46,990 INFO L225 Difference]: With dead ends: 72 [2018-11-14 15:54:46,991 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 15:54:46,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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-14 15:54:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 15:54:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 15:54:47,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:54:47,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 15:54:47,022 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 15:54:47,022 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 15:54:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:47,026 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 15:54:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 15:54:47,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:54:47,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:54:47,028 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 15:54:47,028 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 15:54:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:47,031 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 15:54:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 15:54:47,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:54:47,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:54:47,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:54:47,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:54:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 15:54:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-14 15:54:47,036 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-11-14 15:54:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:54:47,037 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-14 15:54:47,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 15:54:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 15:54:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 15:54:47,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:54:47,039 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:54:47,039 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:54:47,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:54:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash -952620890, now seen corresponding path program 2 times [2018-11-14 15:54:47,041 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:54:47,041 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-14 15:54:47,061 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:54:47,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 15:54:47,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:54:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:54:47,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:54:47,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {930#true} call ULTIMATE.init(); {930#true} is VALID [2018-11-14 15:54:47,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {930#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {930#true} is VALID [2018-11-14 15:54:47,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {930#true} assume true; {930#true} is VALID [2018-11-14 15:54:47,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {930#true} {930#true} #78#return; {930#true} is VALID [2018-11-14 15:54:47,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {930#true} call #t~ret2 := main(); {930#true} is VALID [2018-11-14 15:54:47,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {930#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {950#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:54:47,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {950#(= main_~i~0 (_ bv0 32))} assume true; {950#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:54:47,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {950#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:47,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {957#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {957#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:47,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {957#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {964#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:47,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {964#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {964#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:47,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {964#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {971#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:47,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {971#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {971#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:47,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {971#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {978#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:54:47,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {978#(= (_ bv4 32) main_~i~0)} assume true; {978#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 15:54:47,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {978#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {931#false} is VALID [2018-11-14 15:54:47,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {931#false} ~i~0 := 0bv32; {931#false} is VALID [2018-11-14 15:54:47,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,421 INFO L273 TraceCheckUtils]: 19: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,423 INFO L273 TraceCheckUtils]: 25: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,423 INFO L273 TraceCheckUtils]: 26: Hoare triple {931#false} assume !~bvslt32(~i~0, 100000bv32); {931#false} is VALID [2018-11-14 15:54:47,423 INFO L273 TraceCheckUtils]: 27: Hoare triple {931#false} ~i~0 := 0bv32; {931#false} is VALID [2018-11-14 15:54:47,423 INFO L273 TraceCheckUtils]: 28: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,424 INFO L273 TraceCheckUtils]: 29: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,424 INFO L273 TraceCheckUtils]: 30: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,425 INFO L273 TraceCheckUtils]: 32: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {931#false} assume !~bvslt32(~i~0, 100000bv32); {931#false} is VALID [2018-11-14 15:54:47,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {931#false} havoc ~x~0;~x~0 := 0bv32; {931#false} is VALID [2018-11-14 15:54:47,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,427 INFO L273 TraceCheckUtils]: 40: Hoare triple {931#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {931#false} is VALID [2018-11-14 15:54:47,427 INFO L256 TraceCheckUtils]: 41: Hoare triple {931#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {931#false} is VALID [2018-11-14 15:54:47,428 INFO L273 TraceCheckUtils]: 42: Hoare triple {931#false} ~cond := #in~cond; {931#false} is VALID [2018-11-14 15:54:47,428 INFO L273 TraceCheckUtils]: 43: Hoare triple {931#false} assume ~cond == 0bv32; {931#false} is VALID [2018-11-14 15:54:47,428 INFO L273 TraceCheckUtils]: 44: Hoare triple {931#false} assume !false; {931#false} is VALID [2018-11-14 15:54:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 15:54:47,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:54:47,752 INFO L273 TraceCheckUtils]: 44: Hoare triple {931#false} assume !false; {931#false} is VALID [2018-11-14 15:54:47,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {931#false} assume ~cond == 0bv32; {931#false} is VALID [2018-11-14 15:54:47,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {931#false} ~cond := #in~cond; {931#false} is VALID [2018-11-14 15:54:47,754 INFO L256 TraceCheckUtils]: 41: Hoare triple {931#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {931#false} is VALID [2018-11-14 15:54:47,754 INFO L273 TraceCheckUtils]: 40: Hoare triple {931#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {931#false} is VALID [2018-11-14 15:54:47,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {931#false} havoc ~x~0;~x~0 := 0bv32; {931#false} is VALID [2018-11-14 15:54:47,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {931#false} assume !~bvslt32(~i~0, 100000bv32); {931#false} is VALID [2018-11-14 15:54:47,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,756 INFO L273 TraceCheckUtils]: 34: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,757 INFO L273 TraceCheckUtils]: 32: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,757 INFO L273 TraceCheckUtils]: 31: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,758 INFO L273 TraceCheckUtils]: 28: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,758 INFO L273 TraceCheckUtils]: 27: Hoare triple {931#false} ~i~0 := 0bv32; {931#false} is VALID [2018-11-14 15:54:47,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {931#false} assume !~bvslt32(~i~0, 100000bv32); {931#false} is VALID [2018-11-14 15:54:47,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,761 INFO L273 TraceCheckUtils]: 19: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {931#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#false} is VALID [2018-11-14 15:54:47,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {931#false} assume true; {931#false} is VALID [2018-11-14 15:54:47,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {931#false} ~i~0 := 0bv32; {931#false} is VALID [2018-11-14 15:54:47,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {1159#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {931#false} is VALID [2018-11-14 15:54:47,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {1159#(bvslt main_~i~0 (_ bv100000 32))} assume true; {1159#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:54:47,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {1166#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1159#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:54:47,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {1166#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1166#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:47,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {1173#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1166#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:47,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {1173#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1173#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:47,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {1180#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1173#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:47,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {1180#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1180#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:47,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1180#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:47,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1187#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:47,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {930#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1187#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:47,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {930#true} call #t~ret2 := main(); {930#true} is VALID [2018-11-14 15:54:47,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {930#true} {930#true} #78#return; {930#true} is VALID [2018-11-14 15:54:47,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {930#true} assume true; {930#true} is VALID [2018-11-14 15:54:47,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {930#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {930#true} is VALID [2018-11-14 15:54:47,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {930#true} call ULTIMATE.init(); {930#true} is VALID [2018-11-14 15:54:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 15:54:47,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:54:47,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 15:54:47,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-14 15:54:47,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:54:47,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 15:54:47,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:54:47,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 15:54:47,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 15:54:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 15:54:47,907 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 12 states. [2018-11-14 15:54:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:49,908 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2018-11-14 15:54:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 15:54:49,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-14 15:54:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:54:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:54:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2018-11-14 15:54:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:54:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2018-11-14 15:54:49,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 127 transitions. [2018-11-14 15:54:50,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:54:50,150 INFO L225 Difference]: With dead ends: 120 [2018-11-14 15:54:50,150 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 15:54:50,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 15:54:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 15:54:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-14 15:54:50,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:54:50,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-14 15:54:50,228 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-14 15:54:50,228 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-14 15:54:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:50,232 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-11-14 15:54:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-14 15:54:50,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:54:50,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:54:50,234 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-14 15:54:50,234 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-14 15:54:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:54:50,239 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-11-14 15:54:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-14 15:54:50,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:54:50,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:54:50,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:54:50,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:54:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 15:54:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-11-14 15:54:50,245 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 45 [2018-11-14 15:54:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:54:50,246 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-11-14 15:54:50,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 15:54:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-14 15:54:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 15:54:50,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:54:50,249 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:54:50,249 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:54:50,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:54:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash -527045694, now seen corresponding path program 3 times [2018-11-14 15:54:50,251 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:54:50,251 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-14 15:54:50,281 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 15:54:52,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 15:54:52,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:54:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:54:52,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:54:52,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {1690#true} call ULTIMATE.init(); {1690#true} is VALID [2018-11-14 15:54:52,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {1690#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1690#true} is VALID [2018-11-14 15:54:52,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1690#true} {1690#true} #78#return; {1690#true} is VALID [2018-11-14 15:54:52,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {1690#true} call #t~ret2 := main(); {1690#true} is VALID [2018-11-14 15:54:52,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {1690#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1690#true} is VALID [2018-11-14 15:54:52,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,691 INFO L273 TraceCheckUtils]: 23: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,691 INFO L273 TraceCheckUtils]: 24: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,691 INFO L273 TraceCheckUtils]: 25: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:52,692 INFO L273 TraceCheckUtils]: 26: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:52,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#true} assume !~bvslt32(~i~0, 100000bv32); {1690#true} is VALID [2018-11-14 15:54:52,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#true} ~i~0 := 0bv32; {1779#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:54:52,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {1779#(= main_~i~0 (_ bv0 32))} assume true; {1779#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:54:52,704 INFO L273 TraceCheckUtils]: 30: Hoare triple {1779#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1786#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {1786#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1786#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {1786#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1793#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:54:52,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {1793#(= (_ bv2 32) main_~i~0)} assume true; {1793#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 15:54:52,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {1793#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1800#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,719 INFO L273 TraceCheckUtils]: 35: Hoare triple {1800#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1800#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,719 INFO L273 TraceCheckUtils]: 36: Hoare triple {1800#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1807#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {1807#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1807#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,721 INFO L273 TraceCheckUtils]: 38: Hoare triple {1807#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1814#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,723 INFO L273 TraceCheckUtils]: 39: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1814#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,728 INFO L273 TraceCheckUtils]: 40: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1821#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,728 INFO L273 TraceCheckUtils]: 41: Hoare triple {1821#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {1821#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {1821#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1828#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 15:54:52,732 INFO L273 TraceCheckUtils]: 43: Hoare triple {1828#(= (_ bv7 32) main_~i~0)} assume true; {1828#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 15:54:52,733 INFO L273 TraceCheckUtils]: 44: Hoare triple {1828#(= (_ bv7 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1835#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,734 INFO L273 TraceCheckUtils]: 45: Hoare triple {1835#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {1835#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,735 INFO L273 TraceCheckUtils]: 46: Hoare triple {1835#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1842#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,735 INFO L273 TraceCheckUtils]: 47: Hoare triple {1842#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {1842#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:54:52,737 INFO L273 TraceCheckUtils]: 48: Hoare triple {1842#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1849#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 15:54:52,737 INFO L273 TraceCheckUtils]: 49: Hoare triple {1849#(= (_ bv10 32) main_~i~0)} assume true; {1849#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 15:54:52,739 INFO L273 TraceCheckUtils]: 50: Hoare triple {1849#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1691#false} is VALID [2018-11-14 15:54:52,739 INFO L273 TraceCheckUtils]: 51: Hoare triple {1691#false} ~i~0 := 0bv32; {1691#false} is VALID [2018-11-14 15:54:52,739 INFO L273 TraceCheckUtils]: 52: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,740 INFO L273 TraceCheckUtils]: 54: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,740 INFO L273 TraceCheckUtils]: 55: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,740 INFO L273 TraceCheckUtils]: 56: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,740 INFO L273 TraceCheckUtils]: 57: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,740 INFO L273 TraceCheckUtils]: 58: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,741 INFO L273 TraceCheckUtils]: 61: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,741 INFO L273 TraceCheckUtils]: 62: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,741 INFO L273 TraceCheckUtils]: 63: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,742 INFO L273 TraceCheckUtils]: 64: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,742 INFO L273 TraceCheckUtils]: 65: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,742 INFO L273 TraceCheckUtils]: 66: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,742 INFO L273 TraceCheckUtils]: 67: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,742 INFO L273 TraceCheckUtils]: 68: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,743 INFO L273 TraceCheckUtils]: 69: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,743 INFO L273 TraceCheckUtils]: 70: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,743 INFO L273 TraceCheckUtils]: 71: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:52,743 INFO L273 TraceCheckUtils]: 72: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,744 INFO L273 TraceCheckUtils]: 73: Hoare triple {1691#false} assume !~bvslt32(~i~0, 100000bv32); {1691#false} is VALID [2018-11-14 15:54:52,744 INFO L273 TraceCheckUtils]: 74: Hoare triple {1691#false} havoc ~x~0;~x~0 := 0bv32; {1691#false} is VALID [2018-11-14 15:54:52,744 INFO L273 TraceCheckUtils]: 75: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:52,745 INFO L273 TraceCheckUtils]: 76: Hoare triple {1691#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1691#false} is VALID [2018-11-14 15:54:52,745 INFO L256 TraceCheckUtils]: 77: Hoare triple {1691#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {1691#false} is VALID [2018-11-14 15:54:52,745 INFO L273 TraceCheckUtils]: 78: Hoare triple {1691#false} ~cond := #in~cond; {1691#false} is VALID [2018-11-14 15:54:52,745 INFO L273 TraceCheckUtils]: 79: Hoare triple {1691#false} assume ~cond == 0bv32; {1691#false} is VALID [2018-11-14 15:54:52,746 INFO L273 TraceCheckUtils]: 80: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2018-11-14 15:54:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-14 15:54:52,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:54:53,350 INFO L273 TraceCheckUtils]: 80: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2018-11-14 15:54:53,351 INFO L273 TraceCheckUtils]: 79: Hoare triple {1691#false} assume ~cond == 0bv32; {1691#false} is VALID [2018-11-14 15:54:53,351 INFO L273 TraceCheckUtils]: 78: Hoare triple {1691#false} ~cond := #in~cond; {1691#false} is VALID [2018-11-14 15:54:53,352 INFO L256 TraceCheckUtils]: 77: Hoare triple {1691#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {1691#false} is VALID [2018-11-14 15:54:53,352 INFO L273 TraceCheckUtils]: 76: Hoare triple {1691#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1691#false} is VALID [2018-11-14 15:54:53,352 INFO L273 TraceCheckUtils]: 75: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,352 INFO L273 TraceCheckUtils]: 74: Hoare triple {1691#false} havoc ~x~0;~x~0 := 0bv32; {1691#false} is VALID [2018-11-14 15:54:53,353 INFO L273 TraceCheckUtils]: 73: Hoare triple {1691#false} assume !~bvslt32(~i~0, 100000bv32); {1691#false} is VALID [2018-11-14 15:54:53,353 INFO L273 TraceCheckUtils]: 72: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,354 INFO L273 TraceCheckUtils]: 71: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,354 INFO L273 TraceCheckUtils]: 70: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,354 INFO L273 TraceCheckUtils]: 69: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,354 INFO L273 TraceCheckUtils]: 68: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,355 INFO L273 TraceCheckUtils]: 67: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,355 INFO L273 TraceCheckUtils]: 66: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,355 INFO L273 TraceCheckUtils]: 65: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,355 INFO L273 TraceCheckUtils]: 64: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,356 INFO L273 TraceCheckUtils]: 63: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,356 INFO L273 TraceCheckUtils]: 62: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,356 INFO L273 TraceCheckUtils]: 61: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,357 INFO L273 TraceCheckUtils]: 60: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,357 INFO L273 TraceCheckUtils]: 59: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,357 INFO L273 TraceCheckUtils]: 58: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,357 INFO L273 TraceCheckUtils]: 57: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,358 INFO L273 TraceCheckUtils]: 56: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,358 INFO L273 TraceCheckUtils]: 54: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,358 INFO L273 TraceCheckUtils]: 53: Hoare triple {1691#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1691#false} is VALID [2018-11-14 15:54:53,359 INFO L273 TraceCheckUtils]: 52: Hoare triple {1691#false} assume true; {1691#false} is VALID [2018-11-14 15:54:53,359 INFO L273 TraceCheckUtils]: 51: Hoare triple {1691#false} ~i~0 := 0bv32; {1691#false} is VALID [2018-11-14 15:54:53,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {2036#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1691#false} is VALID [2018-11-14 15:54:53,391 INFO L273 TraceCheckUtils]: 49: Hoare triple {2036#(bvslt main_~i~0 (_ bv100000 32))} assume true; {2036#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:54:53,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {2043#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2036#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:54:53,394 INFO L273 TraceCheckUtils]: 47: Hoare triple {2043#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {2043#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,399 INFO L273 TraceCheckUtils]: 46: Hoare triple {2050#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2043#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,399 INFO L273 TraceCheckUtils]: 45: Hoare triple {2050#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {2050#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {2057#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2050#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,404 INFO L273 TraceCheckUtils]: 43: Hoare triple {2057#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {2057#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,408 INFO L273 TraceCheckUtils]: 42: Hoare triple {2064#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2057#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {2064#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {2064#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {2071#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2064#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {2071#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {2071#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,419 INFO L273 TraceCheckUtils]: 38: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2071#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,420 INFO L273 TraceCheckUtils]: 37: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {2078#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {2085#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2078#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {2085#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {2085#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {2092#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2085#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {2092#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2092#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,436 INFO L273 TraceCheckUtils]: 32: Hoare triple {2099#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2092#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {2099#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {2099#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {2106#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2099#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {2106#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {2106#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#true} ~i~0 := 0bv32; {2106#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:54:53,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#true} assume !~bvslt32(~i~0, 100000bv32); {1690#true} is VALID [2018-11-14 15:54:53,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1690#true} is VALID [2018-11-14 15:54:53,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {1690#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1690#true} is VALID [2018-11-14 15:54:53,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {1690#true} call #t~ret2 := main(); {1690#true} is VALID [2018-11-14 15:54:53,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1690#true} {1690#true} #78#return; {1690#true} is VALID [2018-11-14 15:54:53,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {1690#true} assume true; {1690#true} is VALID [2018-11-14 15:54:53,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {1690#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1690#true} is VALID [2018-11-14 15:54:53,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {1690#true} call ULTIMATE.init(); {1690#true} is VALID [2018-11-14 15:54:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-14 15:54:53,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:54:53,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 15:54:53,462 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2018-11-14 15:54:53,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:54:53,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 15:54:53,625 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-14 15:54:53,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 15:54:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 15:54:53,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 15:54:53,626 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 24 states. [2018-11-14 15:54:55,665 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 7 [2018-11-14 15:55:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:55:00,283 INFO L93 Difference]: Finished difference Result 216 states and 257 transitions. [2018-11-14 15:55:00,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 15:55:00,283 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2018-11-14 15:55:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:55:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:55:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 217 transitions. [2018-11-14 15:55:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:55:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 217 transitions. [2018-11-14 15:55:00,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 217 transitions. [2018-11-14 15:55:00,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:55:00,842 INFO L225 Difference]: With dead ends: 216 [2018-11-14 15:55:00,842 INFO L226 Difference]: Without dead ends: 158 [2018-11-14 15:55:00,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 15:55:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-14 15:55:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-11-14 15:55:00,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:55:00,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2018-11-14 15:55:00,947 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2018-11-14 15:55:00,947 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2018-11-14 15:55:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:55:00,953 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2018-11-14 15:55:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2018-11-14 15:55:00,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:55:00,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:55:00,954 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2018-11-14 15:55:00,954 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2018-11-14 15:55:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:55:00,960 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2018-11-14 15:55:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2018-11-14 15:55:00,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:55:00,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:55:00,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:55:00,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:55:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 15:55:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2018-11-14 15:55:00,967 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 81 [2018-11-14 15:55:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:55:00,967 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2018-11-14 15:55:00,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 15:55:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2018-11-14 15:55:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-14 15:55:00,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:55:00,973 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:55:00,973 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:55:00,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:55:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -118597638, now seen corresponding path program 4 times [2018-11-14 15:55:00,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:55:00,974 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-14 15:55:01,002 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 15:55:01,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 15:55:01,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:55:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:55:01,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:55:01,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {3096#true} call ULTIMATE.init(); {3096#true} is VALID [2018-11-14 15:55:01,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {3096#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3096#true} is VALID [2018-11-14 15:55:01,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {3096#true} assume true; {3096#true} is VALID [2018-11-14 15:55:01,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3096#true} {3096#true} #78#return; {3096#true} is VALID [2018-11-14 15:55:01,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {3096#true} call #t~ret2 := main(); {3096#true} is VALID [2018-11-14 15:55:01,986 INFO L273 TraceCheckUtils]: 5: Hoare triple {3096#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {3116#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:55:01,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {3116#(= main_~i~0 (_ bv0 32))} assume true; {3116#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:55:01,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {3116#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3123#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {3123#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3123#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {3123#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3130#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {3130#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {3130#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {3130#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3137#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {3137#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3137#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {3137#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3144#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {3144#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3144#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {3144#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3151#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {3151#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3151#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:01,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {3151#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3158#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 15:55:02,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {3158#(= (_ bv6 32) main_~i~0)} assume true; {3158#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 15:55:02,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {3158#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3165#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {3165#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3172#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 15:55:02,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {3172#(= (_ bv8 32) main_~i~0)} assume true; {3172#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 15:55:02,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {3172#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3179#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {3179#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {3179#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,005 INFO L273 TraceCheckUtils]: 25: Hoare triple {3179#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3186#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {3186#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {3186#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {3186#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3193#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {3193#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {3193#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {3193#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3200#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-14 15:55:02,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {3200#(= (_ bv12 32) main_~i~0)} assume true; {3200#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-14 15:55:02,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {3200#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3207#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {3207#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {3207#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,011 INFO L273 TraceCheckUtils]: 33: Hoare triple {3207#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3214#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {3214#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {3214#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,013 INFO L273 TraceCheckUtils]: 35: Hoare triple {3214#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3221#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-14 15:55:02,014 INFO L273 TraceCheckUtils]: 36: Hoare triple {3221#(= (_ bv15 32) main_~i~0)} assume true; {3221#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-14 15:55:02,017 INFO L273 TraceCheckUtils]: 37: Hoare triple {3221#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3228#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {3228#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {3228#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {3228#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3235#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 15:55:02,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {3235#(= (_ bv17 32) main_~i~0)} assume true; {3235#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 15:55:02,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {3235#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3242#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,032 INFO L273 TraceCheckUtils]: 42: Hoare triple {3242#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {3242#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {3242#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3249#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-14 15:55:02,033 INFO L273 TraceCheckUtils]: 44: Hoare triple {3249#(= (_ bv19 32) main_~i~0)} assume true; {3249#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-14 15:55:02,033 INFO L273 TraceCheckUtils]: 45: Hoare triple {3249#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3256#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {3256#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {3256#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,034 INFO L273 TraceCheckUtils]: 47: Hoare triple {3256#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3263#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {3263#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {3263#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,035 INFO L273 TraceCheckUtils]: 49: Hoare triple {3263#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3270#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,036 INFO L273 TraceCheckUtils]: 50: Hoare triple {3270#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {3270#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:55:02,036 INFO L273 TraceCheckUtils]: 51: Hoare triple {3270#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3097#false} is VALID [2018-11-14 15:55:02,036 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#false} ~i~0 := 0bv32; {3097#false} is VALID [2018-11-14 15:55:02,037 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,037 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,037 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,037 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,037 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,038 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,038 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,038 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,038 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,039 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,039 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,039 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,039 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,039 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,039 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,040 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,040 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,040 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,040 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,040 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,040 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,040 INFO L273 TraceCheckUtils]: 74: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,040 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,041 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,041 INFO L273 TraceCheckUtils]: 77: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,041 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,041 INFO L273 TraceCheckUtils]: 79: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,041 INFO L273 TraceCheckUtils]: 80: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,041 INFO L273 TraceCheckUtils]: 81: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,041 INFO L273 TraceCheckUtils]: 82: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,041 INFO L273 TraceCheckUtils]: 83: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,042 INFO L273 TraceCheckUtils]: 84: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,042 INFO L273 TraceCheckUtils]: 85: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,042 INFO L273 TraceCheckUtils]: 86: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,042 INFO L273 TraceCheckUtils]: 87: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,042 INFO L273 TraceCheckUtils]: 88: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,042 INFO L273 TraceCheckUtils]: 89: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,042 INFO L273 TraceCheckUtils]: 90: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,043 INFO L273 TraceCheckUtils]: 91: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,043 INFO L273 TraceCheckUtils]: 92: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,043 INFO L273 TraceCheckUtils]: 93: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,043 INFO L273 TraceCheckUtils]: 94: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,043 INFO L273 TraceCheckUtils]: 95: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,043 INFO L273 TraceCheckUtils]: 96: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,043 INFO L273 TraceCheckUtils]: 97: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,044 INFO L273 TraceCheckUtils]: 98: Hoare triple {3097#false} assume !~bvslt32(~i~0, 100000bv32); {3097#false} is VALID [2018-11-14 15:55:02,044 INFO L273 TraceCheckUtils]: 99: Hoare triple {3097#false} ~i~0 := 0bv32; {3097#false} is VALID [2018-11-14 15:55:02,044 INFO L273 TraceCheckUtils]: 100: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,044 INFO L273 TraceCheckUtils]: 101: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,044 INFO L273 TraceCheckUtils]: 102: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,044 INFO L273 TraceCheckUtils]: 103: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,044 INFO L273 TraceCheckUtils]: 104: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,044 INFO L273 TraceCheckUtils]: 105: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,045 INFO L273 TraceCheckUtils]: 106: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,045 INFO L273 TraceCheckUtils]: 107: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,045 INFO L273 TraceCheckUtils]: 108: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,045 INFO L273 TraceCheckUtils]: 109: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,045 INFO L273 TraceCheckUtils]: 110: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,045 INFO L273 TraceCheckUtils]: 111: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,046 INFO L273 TraceCheckUtils]: 112: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,046 INFO L273 TraceCheckUtils]: 113: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,046 INFO L273 TraceCheckUtils]: 114: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,046 INFO L273 TraceCheckUtils]: 115: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,046 INFO L273 TraceCheckUtils]: 116: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,046 INFO L273 TraceCheckUtils]: 117: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,046 INFO L273 TraceCheckUtils]: 118: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,047 INFO L273 TraceCheckUtils]: 119: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,047 INFO L273 TraceCheckUtils]: 120: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,047 INFO L273 TraceCheckUtils]: 121: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,047 INFO L273 TraceCheckUtils]: 122: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,047 INFO L273 TraceCheckUtils]: 123: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,047 INFO L273 TraceCheckUtils]: 124: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,047 INFO L273 TraceCheckUtils]: 125: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,048 INFO L273 TraceCheckUtils]: 126: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,048 INFO L273 TraceCheckUtils]: 127: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,048 INFO L273 TraceCheckUtils]: 128: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,048 INFO L273 TraceCheckUtils]: 129: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,048 INFO L273 TraceCheckUtils]: 130: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,048 INFO L273 TraceCheckUtils]: 131: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,048 INFO L273 TraceCheckUtils]: 132: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,048 INFO L273 TraceCheckUtils]: 133: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,049 INFO L273 TraceCheckUtils]: 134: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,049 INFO L273 TraceCheckUtils]: 135: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,049 INFO L273 TraceCheckUtils]: 136: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,049 INFO L273 TraceCheckUtils]: 137: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,049 INFO L273 TraceCheckUtils]: 138: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,049 INFO L273 TraceCheckUtils]: 139: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,049 INFO L273 TraceCheckUtils]: 140: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,049 INFO L273 TraceCheckUtils]: 141: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,050 INFO L273 TraceCheckUtils]: 142: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,050 INFO L273 TraceCheckUtils]: 143: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:02,050 INFO L273 TraceCheckUtils]: 144: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,050 INFO L273 TraceCheckUtils]: 145: Hoare triple {3097#false} assume !~bvslt32(~i~0, 100000bv32); {3097#false} is VALID [2018-11-14 15:55:02,050 INFO L273 TraceCheckUtils]: 146: Hoare triple {3097#false} havoc ~x~0;~x~0 := 0bv32; {3097#false} is VALID [2018-11-14 15:55:02,050 INFO L273 TraceCheckUtils]: 147: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:02,050 INFO L273 TraceCheckUtils]: 148: Hoare triple {3097#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3097#false} is VALID [2018-11-14 15:55:02,051 INFO L256 TraceCheckUtils]: 149: Hoare triple {3097#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {3097#false} is VALID [2018-11-14 15:55:02,051 INFO L273 TraceCheckUtils]: 150: Hoare triple {3097#false} ~cond := #in~cond; {3097#false} is VALID [2018-11-14 15:55:02,051 INFO L273 TraceCheckUtils]: 151: Hoare triple {3097#false} assume ~cond == 0bv32; {3097#false} is VALID [2018-11-14 15:55:02,051 INFO L273 TraceCheckUtils]: 152: Hoare triple {3097#false} assume !false; {3097#false} is VALID [2018-11-14 15:55:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-14 15:55:02,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:55:04,378 INFO L273 TraceCheckUtils]: 152: Hoare triple {3097#false} assume !false; {3097#false} is VALID [2018-11-14 15:55:04,379 INFO L273 TraceCheckUtils]: 151: Hoare triple {3097#false} assume ~cond == 0bv32; {3097#false} is VALID [2018-11-14 15:55:04,379 INFO L273 TraceCheckUtils]: 150: Hoare triple {3097#false} ~cond := #in~cond; {3097#false} is VALID [2018-11-14 15:55:04,379 INFO L256 TraceCheckUtils]: 149: Hoare triple {3097#false} call __VERIFIER_assert((if #t~mem1 == 44bv32 then 1bv32 else 0bv32)); {3097#false} is VALID [2018-11-14 15:55:04,379 INFO L273 TraceCheckUtils]: 148: Hoare triple {3097#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3097#false} is VALID [2018-11-14 15:55:04,379 INFO L273 TraceCheckUtils]: 147: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,379 INFO L273 TraceCheckUtils]: 146: Hoare triple {3097#false} havoc ~x~0;~x~0 := 0bv32; {3097#false} is VALID [2018-11-14 15:55:04,379 INFO L273 TraceCheckUtils]: 145: Hoare triple {3097#false} assume !~bvslt32(~i~0, 100000bv32); {3097#false} is VALID [2018-11-14 15:55:04,379 INFO L273 TraceCheckUtils]: 144: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,380 INFO L273 TraceCheckUtils]: 143: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,380 INFO L273 TraceCheckUtils]: 142: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,380 INFO L273 TraceCheckUtils]: 141: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,380 INFO L273 TraceCheckUtils]: 140: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,380 INFO L273 TraceCheckUtils]: 139: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,381 INFO L273 TraceCheckUtils]: 138: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,381 INFO L273 TraceCheckUtils]: 137: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,381 INFO L273 TraceCheckUtils]: 136: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,381 INFO L273 TraceCheckUtils]: 135: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,381 INFO L273 TraceCheckUtils]: 134: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,382 INFO L273 TraceCheckUtils]: 133: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,382 INFO L273 TraceCheckUtils]: 132: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,382 INFO L273 TraceCheckUtils]: 131: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,382 INFO L273 TraceCheckUtils]: 130: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,382 INFO L273 TraceCheckUtils]: 129: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,383 INFO L273 TraceCheckUtils]: 128: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,383 INFO L273 TraceCheckUtils]: 127: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,383 INFO L273 TraceCheckUtils]: 126: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,383 INFO L273 TraceCheckUtils]: 125: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,383 INFO L273 TraceCheckUtils]: 124: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,384 INFO L273 TraceCheckUtils]: 123: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,384 INFO L273 TraceCheckUtils]: 122: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,384 INFO L273 TraceCheckUtils]: 121: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,384 INFO L273 TraceCheckUtils]: 120: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,384 INFO L273 TraceCheckUtils]: 119: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,384 INFO L273 TraceCheckUtils]: 118: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,385 INFO L273 TraceCheckUtils]: 117: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,385 INFO L273 TraceCheckUtils]: 116: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,385 INFO L273 TraceCheckUtils]: 115: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,385 INFO L273 TraceCheckUtils]: 114: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,385 INFO L273 TraceCheckUtils]: 113: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,385 INFO L273 TraceCheckUtils]: 112: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,386 INFO L273 TraceCheckUtils]: 111: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,386 INFO L273 TraceCheckUtils]: 110: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,386 INFO L273 TraceCheckUtils]: 109: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,386 INFO L273 TraceCheckUtils]: 108: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,386 INFO L273 TraceCheckUtils]: 107: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,386 INFO L273 TraceCheckUtils]: 106: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,387 INFO L273 TraceCheckUtils]: 105: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,387 INFO L273 TraceCheckUtils]: 104: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,387 INFO L273 TraceCheckUtils]: 103: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,387 INFO L273 TraceCheckUtils]: 102: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,387 INFO L273 TraceCheckUtils]: 101: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,388 INFO L273 TraceCheckUtils]: 100: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,388 INFO L273 TraceCheckUtils]: 99: Hoare triple {3097#false} ~i~0 := 0bv32; {3097#false} is VALID [2018-11-14 15:55:04,388 INFO L273 TraceCheckUtils]: 98: Hoare triple {3097#false} assume !~bvslt32(~i~0, 100000bv32); {3097#false} is VALID [2018-11-14 15:55:04,388 INFO L273 TraceCheckUtils]: 97: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,388 INFO L273 TraceCheckUtils]: 96: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,388 INFO L273 TraceCheckUtils]: 95: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,389 INFO L273 TraceCheckUtils]: 94: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,389 INFO L273 TraceCheckUtils]: 93: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,389 INFO L273 TraceCheckUtils]: 92: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,389 INFO L273 TraceCheckUtils]: 91: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,389 INFO L273 TraceCheckUtils]: 90: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,389 INFO L273 TraceCheckUtils]: 89: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,390 INFO L273 TraceCheckUtils]: 88: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,390 INFO L273 TraceCheckUtils]: 87: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,390 INFO L273 TraceCheckUtils]: 86: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,390 INFO L273 TraceCheckUtils]: 85: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,390 INFO L273 TraceCheckUtils]: 84: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,390 INFO L273 TraceCheckUtils]: 83: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,391 INFO L273 TraceCheckUtils]: 82: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,391 INFO L273 TraceCheckUtils]: 81: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,391 INFO L273 TraceCheckUtils]: 80: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,391 INFO L273 TraceCheckUtils]: 79: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,391 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,392 INFO L273 TraceCheckUtils]: 77: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,392 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,392 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,392 INFO L273 TraceCheckUtils]: 74: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,392 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,392 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,393 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,393 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,393 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,393 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,393 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,394 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,394 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,394 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,394 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,394 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,394 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,395 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,395 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,395 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,395 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,395 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,396 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,396 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3097#false} is VALID [2018-11-14 15:55:04,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#false} assume true; {3097#false} is VALID [2018-11-14 15:55:04,396 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#false} ~i~0 := 0bv32; {3097#false} is VALID [2018-11-14 15:55:04,401 INFO L273 TraceCheckUtils]: 51: Hoare triple {3883#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3097#false} is VALID [2018-11-14 15:55:04,403 INFO L273 TraceCheckUtils]: 50: Hoare triple {3883#(bvslt main_~i~0 (_ bv100000 32))} assume true; {3883#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:55:04,403 INFO L273 TraceCheckUtils]: 49: Hoare triple {3890#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3883#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:55:04,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {3890#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3890#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {3897#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3890#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,410 INFO L273 TraceCheckUtils]: 46: Hoare triple {3897#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {3897#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,414 INFO L273 TraceCheckUtils]: 45: Hoare triple {3904#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3897#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,414 INFO L273 TraceCheckUtils]: 44: Hoare triple {3904#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {3904#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,419 INFO L273 TraceCheckUtils]: 43: Hoare triple {3911#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3904#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {3911#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {3911#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {3918#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3911#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {3918#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {3918#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,428 INFO L273 TraceCheckUtils]: 39: Hoare triple {3925#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3918#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,428 INFO L273 TraceCheckUtils]: 38: Hoare triple {3925#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {3925#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,433 INFO L273 TraceCheckUtils]: 37: Hoare triple {3932#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3925#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {3932#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {3932#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3932#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,440 INFO L273 TraceCheckUtils]: 34: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {3939#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,444 INFO L273 TraceCheckUtils]: 33: Hoare triple {3946#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3939#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,444 INFO L273 TraceCheckUtils]: 32: Hoare triple {3946#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {3946#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {3953#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3946#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {3953#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {3953#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {3960#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3953#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {3960#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume true; {3960#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {3967#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3960#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,460 INFO L273 TraceCheckUtils]: 26: Hoare triple {3967#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume true; {3967#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {3974#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3967#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {3974#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume true; {3974#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {3981#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3974#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {3981#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume true; {3981#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {3988#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3981#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {3988#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume true; {3988#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,479 INFO L273 TraceCheckUtils]: 19: Hoare triple {3995#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3988#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {3995#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume true; {3995#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {4002#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3995#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {4002#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume true; {4002#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4002#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume true; {4009#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {4016#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4009#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {4016#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume true; {4016#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {4023#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4016#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {4023#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume true; {4023#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {4030#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4023#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {4030#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume true; {4030#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {4037#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {4030#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {4037#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume true; {4037#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {3096#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {4037#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:55:04,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {3096#true} call #t~ret2 := main(); {3096#true} is VALID [2018-11-14 15:55:04,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3096#true} {3096#true} #78#return; {3096#true} is VALID [2018-11-14 15:55:04,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {3096#true} assume true; {3096#true} is VALID [2018-11-14 15:55:04,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {3096#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3096#true} is VALID [2018-11-14 15:55:04,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {3096#true} call ULTIMATE.init(); {3096#true} is VALID [2018-11-14 15:55:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-14 15:55:04,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:55:04,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 15:55:04,532 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 153 [2018-11-14 15:55:04,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:55:04,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 15:55:04,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:55:04,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 15:55:04,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 15:55:04,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 15:55:04,760 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 48 states. [2018-11-14 15:55:09,514 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 15:55:09,983 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 15:55:10,492 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 15:55:11,027 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 15:55:11,565 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 15:55:12,112 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 15:55:13,225 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-14 15:55:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:55:35,254 INFO L93 Difference]: Finished difference Result 408 states and 485 transitions. [2018-11-14 15:55:35,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 15:55:35,254 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 153 [2018-11-14 15:55:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:55:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:55:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 397 transitions. [2018-11-14 15:55:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:55:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 397 transitions. [2018-11-14 15:55:35,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 397 transitions. [2018-11-14 15:55:36,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:55:36,192 INFO L225 Difference]: With dead ends: 408 [2018-11-14 15:55:36,192 INFO L226 Difference]: Without dead ends: 302 [2018-11-14 15:55:36,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 15:55:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-14 15:55:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-11-14 15:55:36,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:55:36,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand 302 states. [2018-11-14 15:55:36,526 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand 302 states. [2018-11-14 15:55:36,527 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 302 states. [2018-11-14 15:55:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:55:36,538 INFO L93 Difference]: Finished difference Result 302 states and 305 transitions. [2018-11-14 15:55:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 305 transitions. [2018-11-14 15:55:36,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:55:36,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:55:36,540 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand 302 states. [2018-11-14 15:55:36,540 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 302 states. [2018-11-14 15:55:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:55:36,551 INFO L93 Difference]: Finished difference Result 302 states and 305 transitions. [2018-11-14 15:55:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 305 transitions. [2018-11-14 15:55:36,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:55:36,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:55:36,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:55:36,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:55:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-14 15:55:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 305 transitions. [2018-11-14 15:55:36,564 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 305 transitions. Word has length 153 [2018-11-14 15:55:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:55:36,564 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 305 transitions. [2018-11-14 15:55:36,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 15:55:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 305 transitions. [2018-11-14 15:55:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-14 15:55:36,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:55:36,570 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:55:36,570 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:55:36,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:55:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 61261930, now seen corresponding path program 5 times [2018-11-14 15:55:36,572 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:55:36,572 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-14 15:55:36,600 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1