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-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:42:03,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:42:03,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:42:03,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:42:03,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:42:03,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:42:03,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:42:03,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:42:03,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:42:03,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:42:03,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:42:03,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:42:03,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:42:03,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:42:03,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:42:03,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:42:03,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:42:03,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:42:03,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:42:03,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:42:03,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:42:03,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:42:03,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:42:03,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:42:03,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:42:03,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:42:03,070 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:42:03,070 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:42:03,071 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:42:03,073 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:42:03,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:42:03,074 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:42:03,074 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:42:03,074 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:42:03,075 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:42:03,076 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:42:03,077 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:42:03,093 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:42:03,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:42:03,094 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:42:03,095 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:42:03,095 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:42:03,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:42:03,096 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:42:03,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:42:03,096 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:42:03,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:42:03,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:42:03,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:42:03,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:42:03,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:42:03,098 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:42:03,098 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:42:03,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:42:03,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:42:03,099 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:42:03,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:42:03,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:42:03,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:42:03,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:42:03,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:42:03,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:42:03,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:42:03,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:42:03,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:42:03,101 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:42:03,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:42:03,101 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:42:03,102 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:42:03,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:42:03,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:42:03,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:42:03,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:42:03,173 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:42:03,173 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:42:03,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-14 17:42:03,243 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3329754/c79c283bc42043fbb77277e2e3608839/FLAG6844cd685 [2018-11-14 17:42:03,773 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:42:03,774 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-14 17:42:03,781 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3329754/c79c283bc42043fbb77277e2e3608839/FLAG6844cd685 [2018-11-14 17:42:03,795 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3329754/c79c283bc42043fbb77277e2e3608839 [2018-11-14 17:42:03,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:42:03,806 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:42:03,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:42:03,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:42:03,812 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:42:03,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:42:03" (1/1) ... [2018-11-14 17:42:03,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@251bc0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:03, skipping insertion in model container [2018-11-14 17:42:03,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:42:03" (1/1) ... [2018-11-14 17:42:03,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:42:03,851 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:42:04,052 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:42:04,057 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:42:04,082 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:42:04,108 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:42:04,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04 WrapperNode [2018-11-14 17:42:04,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:42:04,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:42:04,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:42:04,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:42:04,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (1/1) ... [2018-11-14 17:42:04,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (1/1) ... [2018-11-14 17:42:04,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (1/1) ... [2018-11-14 17:42:04,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (1/1) ... [2018-11-14 17:42:04,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (1/1) ... [2018-11-14 17:42:04,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (1/1) ... [2018-11-14 17:42:04,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (1/1) ... [2018-11-14 17:42:04,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:42:04,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:42:04,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:42:04,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:42:04,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (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 17:42:04,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:42:04,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:42:04,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:42:04,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:42:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:42:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:42:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:42:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:42:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:42:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:42:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:42:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:42:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:42:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:42:04,869 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:42:04,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:42:04 BoogieIcfgContainer [2018-11-14 17:42:04,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:42:04,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:42:04,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:42:04,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:42:04,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:42:03" (1/3) ... [2018-11-14 17:42:04,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57928c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:42:04, skipping insertion in model container [2018-11-14 17:42:04,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:04" (2/3) ... [2018-11-14 17:42:04,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57928c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:42:04, skipping insertion in model container [2018-11-14 17:42:04,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:42:04" (3/3) ... [2018-11-14 17:42:04,879 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init2_false-unreach-call_ground.i [2018-11-14 17:42:04,889 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:42:04,897 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:42:04,913 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:42:04,943 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:42:04,944 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:42:04,944 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:42:04,944 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:42:04,944 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:42:04,944 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:42:04,945 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:42:04,945 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:42:04,945 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:42:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-14 17:42:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:42:04,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:42:04,972 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:42:04,975 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:42:04,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:42:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash 339384385, now seen corresponding path program 1 times [2018-11-14 17:42:04,987 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:42:04,988 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 17:42:05,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:42:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:05,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:42:05,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-14 17:42:05,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {31#true} is VALID [2018-11-14 17:42:05,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-14 17:42:05,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #64#return; {31#true} is VALID [2018-11-14 17:42:05,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2018-11-14 17:42:05,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {31#true} is VALID [2018-11-14 17:42:05,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-14 17:42:05,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} ~i~0 := 0bv32; {32#false} is VALID [2018-11-14 17:42:05,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume !true; {32#false} is VALID [2018-11-14 17:42:05,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} havoc ~x~0;~x~0 := 0bv32; {32#false} is VALID [2018-11-14 17:42:05,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} assume true; {32#false} is VALID [2018-11-14 17:42:05,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {32#false} is VALID [2018-11-14 17:42:05,232 INFO L256 TraceCheckUtils]: 12: Hoare triple {32#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {32#false} is VALID [2018-11-14 17:42:05,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-14 17:42:05,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {32#false} assume ~cond == 0bv32; {32#false} is VALID [2018-11-14 17:42:05,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-14 17:42:05,236 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 17:42:05,237 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:42:05,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:42:05,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:42:05,248 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:42:05,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:42:05,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:42:05,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:05,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:42:05,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:42:05,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:42:05,492 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-14 17:42:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:05,668 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-14 17:42:05,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:42:05,669 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:42:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:42:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:42:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-14 17:42:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:42:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-14 17:42:05,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 59 transitions. [2018-11-14 17:42:05,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:05,967 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:42:05,967 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 17:42:05,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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 17:42:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 17:42:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-14 17:42:06,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:42:06,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-14 17:42:06,022 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 17:42:06,022 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 17:42:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:06,026 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 17:42:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 17:42:06,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:06,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:06,028 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 17:42:06,028 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 17:42:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:06,032 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 17:42:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 17:42:06,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:06,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:06,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:42:06,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:42:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:42:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-14 17:42:06,039 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2018-11-14 17:42:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:42:06,039 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-14 17:42:06,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:42:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 17:42:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:42:06,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:42:06,041 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 17:42:06,041 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:42:06,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:42:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash -665726485, now seen corresponding path program 1 times [2018-11-14 17:42:06,042 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:42:06,043 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 17:42:06,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:42:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:06,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:42:06,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {219#true} is VALID [2018-11-14 17:42:06,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {219#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {219#true} is VALID [2018-11-14 17:42:06,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2018-11-14 17:42:06,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #64#return; {219#true} is VALID [2018-11-14 17:42:06,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret2 := main(); {219#true} is VALID [2018-11-14 17:42:06,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {239#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:06,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {239#(= main_~i~0 (_ bv0 32))} assume true; {239#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:06,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {220#false} is VALID [2018-11-14 17:42:06,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {220#false} ~i~0 := 0bv32; {220#false} is VALID [2018-11-14 17:42:06,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {220#false} assume true; {220#false} is VALID [2018-11-14 17:42:06,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {220#false} assume !~bvslt32(~i~0, 100000bv32); {220#false} is VALID [2018-11-14 17:42:06,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {220#false} havoc ~x~0;~x~0 := 0bv32; {220#false} is VALID [2018-11-14 17:42:06,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {220#false} assume true; {220#false} is VALID [2018-11-14 17:42:06,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {220#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {220#false} is VALID [2018-11-14 17:42:06,228 INFO L256 TraceCheckUtils]: 14: Hoare triple {220#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {220#false} is VALID [2018-11-14 17:42:06,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {220#false} ~cond := #in~cond; {220#false} is VALID [2018-11-14 17:42:06,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {220#false} assume ~cond == 0bv32; {220#false} is VALID [2018-11-14 17:42:06,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {220#false} assume !false; {220#false} is VALID [2018-11-14 17:42:06,231 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 17:42:06,231 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 17:42:06,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:42:06,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:42:06,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 17:42:06,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:42:06,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:42:06,295 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 17:42:06,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:42:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:42:06,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:42:06,297 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-14 17:42:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:06,723 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 17:42:06,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:42:06,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 17:42:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:42:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:42:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-14 17:42:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:42:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-14 17:42:06,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-14 17:42:06,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:06,827 INFO L225 Difference]: With dead ends: 42 [2018-11-14 17:42:06,827 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 17:42:06,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 17:42:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 17:42:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 17:42:06,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:42:06,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 17:42:06,859 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:42:06,860 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:42:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:06,862 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-14 17:42:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 17:42:06,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:06,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:06,863 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:42:06,863 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:42:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:06,866 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-14 17:42:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 17:42:06,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:06,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:06,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:42:06,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:42:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:42:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 17:42:06,870 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-14 17:42:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:42:06,870 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 17:42:06,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:42:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 17:42:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:42:06,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:42:06,872 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:42:06,872 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:42:06,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:42:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1817372075, now seen corresponding path program 1 times [2018-11-14 17:42:06,873 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:42:06,873 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 17:42:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:42:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:06,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:42:07,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {424#true} call ULTIMATE.init(); {424#true} is VALID [2018-11-14 17:42:07,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {424#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {424#true} is VALID [2018-11-14 17:42:07,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {424#true} assume true; {424#true} is VALID [2018-11-14 17:42:07,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {424#true} {424#true} #64#return; {424#true} is VALID [2018-11-14 17:42:07,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {424#true} call #t~ret2 := main(); {424#true} is VALID [2018-11-14 17:42:07,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {424#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {444#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:07,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {444#(= main_~i~0 (_ bv0 32))} assume true; {444#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:07,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {444#(= 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); {451#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:07,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {451#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:07,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {451#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {425#false} is VALID [2018-11-14 17:42:07,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {425#false} ~i~0 := 0bv32; {425#false} is VALID [2018-11-14 17:42:07,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {425#false} assume true; {425#false} is VALID [2018-11-14 17:42:07,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {425#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); {425#false} is VALID [2018-11-14 17:42:07,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {425#false} assume true; {425#false} is VALID [2018-11-14 17:42:07,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {425#false} assume !~bvslt32(~i~0, 100000bv32); {425#false} is VALID [2018-11-14 17:42:07,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {425#false} havoc ~x~0;~x~0 := 0bv32; {425#false} is VALID [2018-11-14 17:42:07,045 INFO L273 TraceCheckUtils]: 16: Hoare triple {425#false} assume true; {425#false} is VALID [2018-11-14 17:42:07,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {425#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {425#false} is VALID [2018-11-14 17:42:07,045 INFO L256 TraceCheckUtils]: 18: Hoare triple {425#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {425#false} is VALID [2018-11-14 17:42:07,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {425#false} ~cond := #in~cond; {425#false} is VALID [2018-11-14 17:42:07,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {425#false} assume ~cond == 0bv32; {425#false} is VALID [2018-11-14 17:42:07,046 INFO L273 TraceCheckUtils]: 21: Hoare triple {425#false} assume !false; {425#false} is VALID [2018-11-14 17:42:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:42:07,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:42:07,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {425#false} assume !false; {425#false} is VALID [2018-11-14 17:42:07,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {425#false} assume ~cond == 0bv32; {425#false} is VALID [2018-11-14 17:42:07,257 INFO L273 TraceCheckUtils]: 19: Hoare triple {425#false} ~cond := #in~cond; {425#false} is VALID [2018-11-14 17:42:07,258 INFO L256 TraceCheckUtils]: 18: Hoare triple {425#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {425#false} is VALID [2018-11-14 17:42:07,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {425#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {425#false} is VALID [2018-11-14 17:42:07,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {425#false} assume true; {425#false} is VALID [2018-11-14 17:42:07,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {425#false} havoc ~x~0;~x~0 := 0bv32; {425#false} is VALID [2018-11-14 17:42:07,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {425#false} assume !~bvslt32(~i~0, 100000bv32); {425#false} is VALID [2018-11-14 17:42:07,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {425#false} assume true; {425#false} is VALID [2018-11-14 17:42:07,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {425#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); {425#false} is VALID [2018-11-14 17:42:07,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {425#false} assume true; {425#false} is VALID [2018-11-14 17:42:07,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {425#false} ~i~0 := 0bv32; {425#false} is VALID [2018-11-14 17:42:07,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {530#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {425#false} is VALID [2018-11-14 17:42:07,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {530#(bvslt main_~i~0 (_ bv100000 32))} assume true; {530#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:42:07,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {537#(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); {530#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:42:07,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:07,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {424#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:07,268 INFO L256 TraceCheckUtils]: 4: Hoare triple {424#true} call #t~ret2 := main(); {424#true} is VALID [2018-11-14 17:42:07,268 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {424#true} {424#true} #64#return; {424#true} is VALID [2018-11-14 17:42:07,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {424#true} assume true; {424#true} is VALID [2018-11-14 17:42:07,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {424#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {424#true} is VALID [2018-11-14 17:42:07,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {424#true} call ULTIMATE.init(); {424#true} is VALID [2018-11-14 17:42:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:42:07,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:42:07,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:42:07,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 17:42:07,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:42:07,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:42:07,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:07,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:42:07,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:42:07,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:42:07,346 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-14 17:42:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:07,805 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-14 17:42:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:42:07,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 17:42:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:42:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:42:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-14 17:42:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:42:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-14 17:42:07,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-14 17:42:08,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:08,019 INFO L225 Difference]: With dead ends: 56 [2018-11-14 17:42:08,020 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:42:08,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:42:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:42:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-14 17:42:08,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:42:08,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-14 17:42:08,046 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 17:42:08,046 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 17:42:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:08,050 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 17:42:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 17:42:08,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:08,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:08,051 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 17:42:08,051 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 17:42:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:08,054 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 17:42:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 17:42:08,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:08,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:08,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:42:08,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:42:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:42:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-14 17:42:08,058 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 22 [2018-11-14 17:42:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:42:08,058 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-14 17:42:08,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:42:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 17:42:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:42:08,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:42:08,060 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:42:08,060 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:42:08,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:42:08,061 INFO L82 PathProgramCache]: Analyzing trace with hash -732385557, now seen corresponding path program 2 times [2018-11-14 17:42:08,062 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:42:08,062 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 17:42:08,079 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:42:08,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:42:08,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:42:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:08,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:42:08,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {775#true} is VALID [2018-11-14 17:42:08,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {775#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {775#true} is VALID [2018-11-14 17:42:08,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2018-11-14 17:42:08,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #64#return; {775#true} is VALID [2018-11-14 17:42:08,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret2 := main(); {775#true} is VALID [2018-11-14 17:42:08,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {795#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:08,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {795#(= main_~i~0 (_ bv0 32))} assume true; {795#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:08,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {795#(= 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); {802#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:08,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {802#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:08,376 INFO L273 TraceCheckUtils]: 9: Hoare triple {802#(= (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); {809#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:08,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {809#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {809#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:08,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {809#(= (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); {816#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:08,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {816#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {816#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:08,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {816#(= (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); {823#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:08,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {823#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {823#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:08,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {823#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {776#false} is VALID [2018-11-14 17:42:08,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {776#false} ~i~0 := 0bv32; {776#false} is VALID [2018-11-14 17:42:08,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {776#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); {776#false} is VALID [2018-11-14 17:42:08,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {776#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); {776#false} is VALID [2018-11-14 17:42:08,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {776#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); {776#false} is VALID [2018-11-14 17:42:08,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {776#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); {776#false} is VALID [2018-11-14 17:42:08,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {776#false} assume !~bvslt32(~i~0, 100000bv32); {776#false} is VALID [2018-11-14 17:42:08,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {776#false} havoc ~x~0;~x~0 := 0bv32; {776#false} is VALID [2018-11-14 17:42:08,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {776#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {776#false} is VALID [2018-11-14 17:42:08,397 INFO L256 TraceCheckUtils]: 30: Hoare triple {776#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {776#false} is VALID [2018-11-14 17:42:08,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2018-11-14 17:42:08,398 INFO L273 TraceCheckUtils]: 32: Hoare triple {776#false} assume ~cond == 0bv32; {776#false} is VALID [2018-11-14 17:42:08,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {776#false} assume !false; {776#false} is VALID [2018-11-14 17:42:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 17:42:08,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:42:08,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {776#false} assume !false; {776#false} is VALID [2018-11-14 17:42:08,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {776#false} assume ~cond == 0bv32; {776#false} is VALID [2018-11-14 17:42:08,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2018-11-14 17:42:08,675 INFO L256 TraceCheckUtils]: 30: Hoare triple {776#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {776#false} is VALID [2018-11-14 17:42:08,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {776#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {776#false} is VALID [2018-11-14 17:42:08,676 INFO L273 TraceCheckUtils]: 28: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,676 INFO L273 TraceCheckUtils]: 27: Hoare triple {776#false} havoc ~x~0;~x~0 := 0bv32; {776#false} is VALID [2018-11-14 17:42:08,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {776#false} assume !~bvslt32(~i~0, 100000bv32); {776#false} is VALID [2018-11-14 17:42:08,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {776#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); {776#false} is VALID [2018-11-14 17:42:08,678 INFO L273 TraceCheckUtils]: 23: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {776#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); {776#false} is VALID [2018-11-14 17:42:08,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {776#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); {776#false} is VALID [2018-11-14 17:42:08,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {776#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); {776#false} is VALID [2018-11-14 17:42:08,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {776#false} assume true; {776#false} is VALID [2018-11-14 17:42:08,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {776#false} ~i~0 := 0bv32; {776#false} is VALID [2018-11-14 17:42:08,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {938#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {776#false} is VALID [2018-11-14 17:42:08,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {938#(bvslt main_~i~0 (_ bv100000 32))} assume true; {938#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:42:08,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {945#(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); {938#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:42:08,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {945#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {945#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:08,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {952#(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); {945#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:08,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {952#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {952#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:08,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {959#(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); {952#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:08,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {959#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:08,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {966#(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); {959#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:08,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {966#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {966#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:08,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {966#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:08,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret2 := main(); {775#true} is VALID [2018-11-14 17:42:08,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #64#return; {775#true} is VALID [2018-11-14 17:42:08,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2018-11-14 17:42:08,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {775#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {775#true} is VALID [2018-11-14 17:42:08,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {775#true} is VALID [2018-11-14 17:42:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 17:42:08,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:42:08,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:42:08,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-14 17:42:08,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:42:08,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:42:08,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:08,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:42:08,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:42:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:42:08,810 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 12 states. [2018-11-14 17:42:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:10,082 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-11-14 17:42:10,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:42:10,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-14 17:42:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:42:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:42:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2018-11-14 17:42:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:42:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2018-11-14 17:42:10,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2018-11-14 17:42:10,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:10,306 INFO L225 Difference]: With dead ends: 86 [2018-11-14 17:42:10,306 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 17:42:10,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:42:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 17:42:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-14 17:42:10,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:42:10,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2018-11-14 17:42:10,393 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-14 17:42:10,393 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-14 17:42:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:10,397 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-14 17:42:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-14 17:42:10,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:10,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:10,398 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-14 17:42:10,398 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-14 17:42:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:10,402 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-14 17:42:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-14 17:42:10,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:10,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:10,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:42:10,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:42:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 17:42:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-14 17:42:10,407 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 34 [2018-11-14 17:42:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:42:10,407 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-14 17:42:10,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:42:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-14 17:42:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:42:10,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:42:10,409 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:42:10,410 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:42:10,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:42:10,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1301135253, now seen corresponding path program 3 times [2018-11-14 17:42:10,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:42:10,411 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 17:42:10,431 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:42:11,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 17:42:11,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:42:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:11,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:42:11,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {1339#true} call ULTIMATE.init(); {1339#true} is VALID [2018-11-14 17:42:11,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {1339#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1339#true} is VALID [2018-11-14 17:42:11,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1339#true} {1339#true} #64#return; {1339#true} is VALID [2018-11-14 17:42:11,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {1339#true} call #t~ret2 := main(); {1339#true} is VALID [2018-11-14 17:42:11,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {1339#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1339#true} is VALID [2018-11-14 17:42:11,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,791 INFO L273 TraceCheckUtils]: 25: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:11,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:11,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {1339#true} assume !~bvslt32(~i~0, 100000bv32); {1339#true} is VALID [2018-11-14 17:42:11,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {1339#true} ~i~0 := 0bv32; {1428#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:11,792 INFO L273 TraceCheckUtils]: 29: Hoare triple {1428#(= main_~i~0 (_ bv0 32))} assume true; {1428#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:11,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {1428#(= 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); {1435#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {1435#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1435#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {1435#(= (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); {1442#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:42:11,795 INFO L273 TraceCheckUtils]: 33: Hoare triple {1442#(= (_ bv2 32) main_~i~0)} assume true; {1442#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:42:11,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {1442#(= (_ 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); {1449#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {1449#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1449#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {1449#(= (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); {1456#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 17:42:11,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {1456#(= (_ bv4 32) main_~i~0)} assume true; {1456#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 17:42:11,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {1456#(= (_ bv4 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); {1463#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,801 INFO L273 TraceCheckUtils]: 39: Hoare triple {1463#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1463#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {1463#(= (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); {1470#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {1470#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {1470#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {1470#(= (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); {1477#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {1477#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1477#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,808 INFO L273 TraceCheckUtils]: 44: Hoare triple {1477#(= (bvadd main_~i~0 (_ bv4294967289 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); {1484#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,809 INFO L273 TraceCheckUtils]: 45: Hoare triple {1484#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {1484#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,813 INFO L273 TraceCheckUtils]: 46: Hoare triple {1484#(= (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); {1491#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 17:42:11,814 INFO L273 TraceCheckUtils]: 47: Hoare triple {1491#(= (_ bv9 32) main_~i~0)} assume true; {1491#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 17:42:11,815 INFO L273 TraceCheckUtils]: 48: Hoare triple {1491#(= (_ bv9 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); {1498#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,816 INFO L273 TraceCheckUtils]: 49: Hoare triple {1498#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {1498#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:11,816 INFO L273 TraceCheckUtils]: 50: Hoare triple {1498#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1340#false} is VALID [2018-11-14 17:42:11,817 INFO L273 TraceCheckUtils]: 51: Hoare triple {1340#false} havoc ~x~0;~x~0 := 0bv32; {1340#false} is VALID [2018-11-14 17:42:11,817 INFO L273 TraceCheckUtils]: 52: Hoare triple {1340#false} assume true; {1340#false} is VALID [2018-11-14 17:42:11,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {1340#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1340#false} is VALID [2018-11-14 17:42:11,818 INFO L256 TraceCheckUtils]: 54: Hoare triple {1340#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {1340#false} is VALID [2018-11-14 17:42:11,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {1340#false} ~cond := #in~cond; {1340#false} is VALID [2018-11-14 17:42:11,818 INFO L273 TraceCheckUtils]: 56: Hoare triple {1340#false} assume ~cond == 0bv32; {1340#false} is VALID [2018-11-14 17:42:11,819 INFO L273 TraceCheckUtils]: 57: Hoare triple {1340#false} assume !false; {1340#false} is VALID [2018-11-14 17:42:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 17:42:11,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:42:12,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {1340#false} assume !false; {1340#false} is VALID [2018-11-14 17:42:12,367 INFO L273 TraceCheckUtils]: 56: Hoare triple {1340#false} assume ~cond == 0bv32; {1340#false} is VALID [2018-11-14 17:42:12,367 INFO L273 TraceCheckUtils]: 55: Hoare triple {1340#false} ~cond := #in~cond; {1340#false} is VALID [2018-11-14 17:42:12,367 INFO L256 TraceCheckUtils]: 54: Hoare triple {1340#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {1340#false} is VALID [2018-11-14 17:42:12,368 INFO L273 TraceCheckUtils]: 53: Hoare triple {1340#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1340#false} is VALID [2018-11-14 17:42:12,368 INFO L273 TraceCheckUtils]: 52: Hoare triple {1340#false} assume true; {1340#false} is VALID [2018-11-14 17:42:12,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {1340#false} havoc ~x~0;~x~0 := 0bv32; {1340#false} is VALID [2018-11-14 17:42:12,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {1547#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1340#false} is VALID [2018-11-14 17:42:12,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {1547#(bvslt main_~i~0 (_ bv100000 32))} assume true; {1547#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:42:12,377 INFO L273 TraceCheckUtils]: 48: Hoare triple {1554#(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); {1547#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:42:12,377 INFO L273 TraceCheckUtils]: 47: Hoare triple {1554#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1554#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,383 INFO L273 TraceCheckUtils]: 46: Hoare triple {1561#(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); {1554#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,383 INFO L273 TraceCheckUtils]: 45: Hoare triple {1561#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1561#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,388 INFO L273 TraceCheckUtils]: 44: Hoare triple {1568#(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); {1561#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,389 INFO L273 TraceCheckUtils]: 43: Hoare triple {1568#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1568#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,393 INFO L273 TraceCheckUtils]: 42: Hoare triple {1575#(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); {1568#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,394 INFO L273 TraceCheckUtils]: 41: Hoare triple {1575#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1575#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,399 INFO L273 TraceCheckUtils]: 40: Hoare triple {1582#(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); {1575#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {1582#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {1582#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {1589#(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); {1582#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,405 INFO L273 TraceCheckUtils]: 37: Hoare triple {1589#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {1589#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {1596#(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); {1589#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {1596#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {1596#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {1603#(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); {1596#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {1603#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {1603#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,423 INFO L273 TraceCheckUtils]: 32: Hoare triple {1610#(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); {1603#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {1610#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {1610#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {1617#(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); {1610#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {1617#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {1617#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,431 INFO L273 TraceCheckUtils]: 28: Hoare triple {1339#true} ~i~0 := 0bv32; {1617#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:12,431 INFO L273 TraceCheckUtils]: 27: Hoare triple {1339#true} assume !~bvslt32(~i~0, 100000bv32); {1339#true} is VALID [2018-11-14 17:42:12,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,433 INFO L273 TraceCheckUtils]: 19: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {1339#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); {1339#true} is VALID [2018-11-14 17:42:12,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {1339#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1339#true} is VALID [2018-11-14 17:42:12,437 INFO L256 TraceCheckUtils]: 4: Hoare triple {1339#true} call #t~ret2 := main(); {1339#true} is VALID [2018-11-14 17:42:12,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1339#true} {1339#true} #64#return; {1339#true} is VALID [2018-11-14 17:42:12,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {1339#true} assume true; {1339#true} is VALID [2018-11-14 17:42:12,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {1339#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1339#true} is VALID [2018-11-14 17:42:12,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {1339#true} call ULTIMATE.init(); {1339#true} is VALID [2018-11-14 17:42:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 17:42:12,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:42:12,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 17:42:12,450 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-11-14 17:42:12,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:42:12,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:42:12,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:12,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:42:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:42:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:42:12,607 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 24 states. [2018-11-14 17:42:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:17,729 INFO L93 Difference]: Finished difference Result 146 states and 173 transitions. [2018-11-14 17:42:17,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:42:17,730 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-11-14 17:42:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:42:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:42:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 153 transitions. [2018-11-14 17:42:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:42:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 153 transitions. [2018-11-14 17:42:17,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 153 transitions. [2018-11-14 17:42:18,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:18,101 INFO L225 Difference]: With dead ends: 146 [2018-11-14 17:42:18,102 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 17:42:18,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:42:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 17:42:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-14 17:42:18,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:42:18,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-14 17:42:18,218 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-14 17:42:18,218 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-14 17:42:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:18,222 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-14 17:42:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-14 17:42:18,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:18,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:18,224 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-14 17:42:18,224 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-14 17:42:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:18,228 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-14 17:42:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-14 17:42:18,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:18,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:18,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:42:18,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:42:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-14 17:42:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-11-14 17:42:18,233 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 58 [2018-11-14 17:42:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:42:18,234 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-11-14 17:42:18,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:42:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-14 17:42:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 17:42:18,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:42:18,237 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:42:18,238 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:42:18,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:42:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1684906133, now seen corresponding path program 4 times [2018-11-14 17:42:18,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:42:18,239 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 17:42:18,258 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:42:18,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:42:18,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:42:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:42:18,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:42:19,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {2339#true} call ULTIMATE.init(); {2339#true} is VALID [2018-11-14 17:42:19,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {2339#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2339#true} is VALID [2018-11-14 17:42:19,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 17:42:19,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2339#true} {2339#true} #64#return; {2339#true} is VALID [2018-11-14 17:42:19,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {2339#true} call #t~ret2 := main(); {2339#true} is VALID [2018-11-14 17:42:19,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2359#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:19,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {2359#(= main_~i~0 (_ bv0 32))} assume true; {2359#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:42:19,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {2359#(= 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); {2366#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {2366#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2366#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {2366#(= (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); {2373#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {2373#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2373#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {2373#(= (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); {2380#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {2380#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2380#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {2380#(= (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); {2387#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 17:42:19,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {2387#(= (_ bv4 32) main_~i~0)} assume true; {2387#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 17:42:19,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {2387#(= (_ bv4 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); {2394#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {2394#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2394#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {2394#(= (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); {2401#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 17:42:19,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {2401#(= (_ bv6 32) main_~i~0)} assume true; {2401#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 17:42:19,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {2401#(= (_ 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); {2408#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {2408#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {2408#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {2408#(= (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); {2415#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {2415#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2415#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {2415#(= (bvadd main_~i~0 (_ bv4294967288 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); {2422#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {2422#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {2422#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {2422#(= (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); {2429#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {2429#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2429#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {2429#(= (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); {2436#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-14 17:42:19,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {2436#(= (_ bv11 32) main_~i~0)} assume true; {2436#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-14 17:42:19,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {2436#(= (_ bv11 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); {2443#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {2443#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {2443#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {2443#(= (bvadd main_~i~0 (_ bv4294967284 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); {2450#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {2450#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {2450#(= (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); {2457#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-14 17:42:19,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {2457#(= (_ bv14 32) main_~i~0)} assume true; {2457#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-14 17:42:19,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {2457#(= (_ bv14 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); {2464#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {2464#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {2464#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {2464#(= (bvadd main_~i~0 (_ bv4294967281 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); {2471#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,370 INFO L273 TraceCheckUtils]: 38: Hoare triple {2471#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {2471#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,370 INFO L273 TraceCheckUtils]: 39: Hoare triple {2471#(= (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); {2478#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 17:42:19,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {2478#(= (_ bv17 32) main_~i~0)} assume true; {2478#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 17:42:19,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {2478#(= (_ 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); {2485#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {2485#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {2485#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {2485#(= (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); {2492#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,374 INFO L273 TraceCheckUtils]: 44: Hoare triple {2492#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {2492#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {2492#(= (bvadd main_~i~0 (_ bv4294967277 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); {2499#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {2499#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {2499#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,377 INFO L273 TraceCheckUtils]: 47: Hoare triple {2499#(= (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); {2506#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-14 17:42:19,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {2506#(= (_ bv21 32) main_~i~0)} assume true; {2506#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-14 17:42:19,379 INFO L273 TraceCheckUtils]: 49: Hoare triple {2506#(= (_ bv21 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); {2513#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,379 INFO L273 TraceCheckUtils]: 50: Hoare triple {2513#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {2513#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:42:19,380 INFO L273 TraceCheckUtils]: 51: Hoare triple {2513#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2340#false} is VALID [2018-11-14 17:42:19,380 INFO L273 TraceCheckUtils]: 52: Hoare triple {2340#false} ~i~0 := 0bv32; {2340#false} is VALID [2018-11-14 17:42:19,380 INFO L273 TraceCheckUtils]: 53: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,380 INFO L273 TraceCheckUtils]: 54: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,380 INFO L273 TraceCheckUtils]: 55: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,381 INFO L273 TraceCheckUtils]: 57: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,381 INFO L273 TraceCheckUtils]: 58: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,381 INFO L273 TraceCheckUtils]: 59: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,381 INFO L273 TraceCheckUtils]: 60: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,381 INFO L273 TraceCheckUtils]: 61: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,381 INFO L273 TraceCheckUtils]: 62: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,381 INFO L273 TraceCheckUtils]: 63: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,382 INFO L273 TraceCheckUtils]: 64: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,382 INFO L273 TraceCheckUtils]: 65: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,382 INFO L273 TraceCheckUtils]: 66: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,382 INFO L273 TraceCheckUtils]: 67: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,382 INFO L273 TraceCheckUtils]: 70: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,383 INFO L273 TraceCheckUtils]: 71: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,383 INFO L273 TraceCheckUtils]: 72: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,383 INFO L273 TraceCheckUtils]: 73: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,383 INFO L273 TraceCheckUtils]: 74: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,383 INFO L273 TraceCheckUtils]: 75: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,383 INFO L273 TraceCheckUtils]: 76: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,383 INFO L273 TraceCheckUtils]: 77: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,384 INFO L273 TraceCheckUtils]: 78: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,384 INFO L273 TraceCheckUtils]: 79: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,384 INFO L273 TraceCheckUtils]: 80: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,384 INFO L273 TraceCheckUtils]: 81: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,384 INFO L273 TraceCheckUtils]: 82: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,384 INFO L273 TraceCheckUtils]: 83: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,385 INFO L273 TraceCheckUtils]: 84: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,385 INFO L273 TraceCheckUtils]: 85: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,385 INFO L273 TraceCheckUtils]: 86: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,385 INFO L273 TraceCheckUtils]: 87: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,385 INFO L273 TraceCheckUtils]: 88: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,385 INFO L273 TraceCheckUtils]: 89: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,385 INFO L273 TraceCheckUtils]: 90: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,386 INFO L273 TraceCheckUtils]: 91: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,386 INFO L273 TraceCheckUtils]: 92: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,386 INFO L273 TraceCheckUtils]: 93: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,386 INFO L273 TraceCheckUtils]: 94: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,386 INFO L273 TraceCheckUtils]: 95: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,387 INFO L273 TraceCheckUtils]: 96: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:19,387 INFO L273 TraceCheckUtils]: 97: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,387 INFO L273 TraceCheckUtils]: 98: Hoare triple {2340#false} assume !~bvslt32(~i~0, 100000bv32); {2340#false} is VALID [2018-11-14 17:42:19,387 INFO L273 TraceCheckUtils]: 99: Hoare triple {2340#false} havoc ~x~0;~x~0 := 0bv32; {2340#false} is VALID [2018-11-14 17:42:19,387 INFO L273 TraceCheckUtils]: 100: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:19,388 INFO L273 TraceCheckUtils]: 101: Hoare triple {2340#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2340#false} is VALID [2018-11-14 17:42:19,388 INFO L256 TraceCheckUtils]: 102: Hoare triple {2340#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {2340#false} is VALID [2018-11-14 17:42:19,388 INFO L273 TraceCheckUtils]: 103: Hoare triple {2340#false} ~cond := #in~cond; {2340#false} is VALID [2018-11-14 17:42:19,388 INFO L273 TraceCheckUtils]: 104: Hoare triple {2340#false} assume ~cond == 0bv32; {2340#false} is VALID [2018-11-14 17:42:19,388 INFO L273 TraceCheckUtils]: 105: Hoare triple {2340#false} assume !false; {2340#false} is VALID [2018-11-14 17:42:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 17:42:19,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:42:21,234 INFO L273 TraceCheckUtils]: 105: Hoare triple {2340#false} assume !false; {2340#false} is VALID [2018-11-14 17:42:21,235 INFO L273 TraceCheckUtils]: 104: Hoare triple {2340#false} assume ~cond == 0bv32; {2340#false} is VALID [2018-11-14 17:42:21,235 INFO L273 TraceCheckUtils]: 103: Hoare triple {2340#false} ~cond := #in~cond; {2340#false} is VALID [2018-11-14 17:42:21,235 INFO L256 TraceCheckUtils]: 102: Hoare triple {2340#false} call __VERIFIER_assert((if #t~mem1 == 42bv32 then 1bv32 else 0bv32)); {2340#false} is VALID [2018-11-14 17:42:21,236 INFO L273 TraceCheckUtils]: 101: Hoare triple {2340#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2340#false} is VALID [2018-11-14 17:42:21,236 INFO L273 TraceCheckUtils]: 100: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,236 INFO L273 TraceCheckUtils]: 99: Hoare triple {2340#false} havoc ~x~0;~x~0 := 0bv32; {2340#false} is VALID [2018-11-14 17:42:21,236 INFO L273 TraceCheckUtils]: 98: Hoare triple {2340#false} assume !~bvslt32(~i~0, 100000bv32); {2340#false} is VALID [2018-11-14 17:42:21,237 INFO L273 TraceCheckUtils]: 97: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,237 INFO L273 TraceCheckUtils]: 96: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,237 INFO L273 TraceCheckUtils]: 95: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,237 INFO L273 TraceCheckUtils]: 94: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,237 INFO L273 TraceCheckUtils]: 93: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,237 INFO L273 TraceCheckUtils]: 92: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,238 INFO L273 TraceCheckUtils]: 91: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,238 INFO L273 TraceCheckUtils]: 90: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,238 INFO L273 TraceCheckUtils]: 89: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,238 INFO L273 TraceCheckUtils]: 88: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,239 INFO L273 TraceCheckUtils]: 87: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,239 INFO L273 TraceCheckUtils]: 86: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,239 INFO L273 TraceCheckUtils]: 85: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,239 INFO L273 TraceCheckUtils]: 84: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,239 INFO L273 TraceCheckUtils]: 83: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,240 INFO L273 TraceCheckUtils]: 82: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,240 INFO L273 TraceCheckUtils]: 81: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,240 INFO L273 TraceCheckUtils]: 80: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,240 INFO L273 TraceCheckUtils]: 79: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,240 INFO L273 TraceCheckUtils]: 78: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,241 INFO L273 TraceCheckUtils]: 77: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,241 INFO L273 TraceCheckUtils]: 76: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,241 INFO L273 TraceCheckUtils]: 75: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,241 INFO L273 TraceCheckUtils]: 74: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,241 INFO L273 TraceCheckUtils]: 73: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,242 INFO L273 TraceCheckUtils]: 72: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,242 INFO L273 TraceCheckUtils]: 71: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,242 INFO L273 TraceCheckUtils]: 70: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,242 INFO L273 TraceCheckUtils]: 69: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,242 INFO L273 TraceCheckUtils]: 68: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,242 INFO L273 TraceCheckUtils]: 67: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,243 INFO L273 TraceCheckUtils]: 66: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,243 INFO L273 TraceCheckUtils]: 65: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,243 INFO L273 TraceCheckUtils]: 64: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,243 INFO L273 TraceCheckUtils]: 63: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,244 INFO L273 TraceCheckUtils]: 59: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,244 INFO L273 TraceCheckUtils]: 58: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,244 INFO L273 TraceCheckUtils]: 57: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,245 INFO L273 TraceCheckUtils]: 54: Hoare triple {2340#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); {2340#false} is VALID [2018-11-14 17:42:21,245 INFO L273 TraceCheckUtils]: 53: Hoare triple {2340#false} assume true; {2340#false} is VALID [2018-11-14 17:42:21,245 INFO L273 TraceCheckUtils]: 52: Hoare triple {2340#false} ~i~0 := 0bv32; {2340#false} is VALID [2018-11-14 17:42:21,265 INFO L273 TraceCheckUtils]: 51: Hoare triple {2844#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2340#false} is VALID [2018-11-14 17:42:21,278 INFO L273 TraceCheckUtils]: 50: Hoare triple {2844#(bvslt main_~i~0 (_ bv100000 32))} assume true; {2844#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:42:21,282 INFO L273 TraceCheckUtils]: 49: Hoare triple {2851#(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); {2844#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:42:21,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {2851#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {2851#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {2858#(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); {2851#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {2858#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {2858#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {2865#(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); {2858#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {2865#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {2865#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,297 INFO L273 TraceCheckUtils]: 43: Hoare triple {2872#(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); {2865#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,297 INFO L273 TraceCheckUtils]: 42: Hoare triple {2872#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {2872#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,300 INFO L273 TraceCheckUtils]: 41: Hoare triple {2879#(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); {2872#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,301 INFO L273 TraceCheckUtils]: 40: Hoare triple {2879#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {2879#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {2886#(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); {2879#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {2886#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {2886#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,310 INFO L273 TraceCheckUtils]: 37: Hoare triple {2893#(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); {2886#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,311 INFO L273 TraceCheckUtils]: 36: Hoare triple {2893#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {2893#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {2900#(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); {2893#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,317 INFO L273 TraceCheckUtils]: 34: Hoare triple {2900#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2900#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,326 INFO L273 TraceCheckUtils]: 33: Hoare triple {2907#(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); {2900#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,327 INFO L273 TraceCheckUtils]: 32: Hoare triple {2907#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {2907#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {2914#(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); {2907#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {2914#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {2914#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {2921#(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); {2914#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,339 INFO L273 TraceCheckUtils]: 28: Hoare triple {2921#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume true; {2921#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {2928#(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); {2921#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {2928#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume true; {2928#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {2935#(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); {2928#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {2935#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume true; {2935#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {2942#(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); {2935#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {2942#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume true; {2942#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {2949#(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); {2942#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {2949#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume true; {2949#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {2956#(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); {2949#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {2956#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume true; {2956#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {2963#(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); {2956#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {2963#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume true; {2963#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {2970#(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); {2963#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {2970#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume true; {2970#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {2977#(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); {2970#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {2977#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume true; {2977#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {2984#(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); {2977#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {2984#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume true; {2984#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {2991#(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); {2984#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {2991#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume true; {2991#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {2998#(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); {2991#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {2998#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume true; {2998#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2998#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:42:21,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {2339#true} call #t~ret2 := main(); {2339#true} is VALID [2018-11-14 17:42:21,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2339#true} {2339#true} #64#return; {2339#true} is VALID [2018-11-14 17:42:21,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 17:42:21,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {2339#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2339#true} is VALID [2018-11-14 17:42:21,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {2339#true} call ULTIMATE.init(); {2339#true} is VALID [2018-11-14 17:42:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 17:42:21,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:42:21,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 17:42:21,409 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 106 [2018-11-14 17:42:21,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:42:21,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 17:42:21,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:21,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 17:42:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 17:42:21,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:42:21,629 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 48 states. [2018-11-14 17:42:25,742 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 17:42:26,352 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 17:42:26,854 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 17:42:27,399 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 17:42:27,936 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 17:42:28,539 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 17:42:29,097 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 17:42:29,685 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-14 17:42:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:43,753 INFO L93 Difference]: Finished difference Result 266 states and 317 transitions. [2018-11-14 17:42:43,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 17:42:43,753 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 106 [2018-11-14 17:42:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:42:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:42:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 273 transitions. [2018-11-14 17:42:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:42:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 273 transitions. [2018-11-14 17:42:43,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 273 transitions. [2018-11-14 17:42:44,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:42:44,487 INFO L225 Difference]: With dead ends: 266 [2018-11-14 17:42:44,487 INFO L226 Difference]: Without dead ends: 207 [2018-11-14 17:42:44,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 17:42:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-14 17:42:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-11-14 17:42:44,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:42:44,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand 207 states. [2018-11-14 17:42:44,700 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 207 states. [2018-11-14 17:42:44,700 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 207 states. [2018-11-14 17:42:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:44,709 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-11-14 17:42:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 209 transitions. [2018-11-14 17:42:44,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:44,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:44,710 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 207 states. [2018-11-14 17:42:44,710 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 207 states. [2018-11-14 17:42:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:42:44,718 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-11-14 17:42:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 209 transitions. [2018-11-14 17:42:44,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:42:44,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:42:44,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:42:44,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:42:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-14 17:42:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 209 transitions. [2018-11-14 17:42:44,727 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 209 transitions. Word has length 106 [2018-11-14 17:42:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:42:44,728 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 209 transitions. [2018-11-14 17:42:44,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 17:42:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 209 transitions. [2018-11-14 17:42:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-14 17:42:44,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:42:44,732 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:42:44,732 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:42:44,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:42:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1733390997, now seen corresponding path program 5 times [2018-11-14 17:42:44,733 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:42:44,734 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 17:42:44,771 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1